227 0

Protograph design with multiple edges for regular QC LDPC codes having large girth

Title
Protograph design with multiple edges for regular QC LDPC codes having large girth
Author
신동준
Keywords
Systematics; Upper bound; Iterative decoding; Bipartite graph; Educational institutions; Electronic mail
Issue Date
2011-08
Publisher
IEEE
Citation
2011 IEEE International Symposium on Information Theory Proceedings, p.918-922
Abstract
In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density parity-check (LDPC) codes from having large girth are searched in allowance with multiple edges based on graph theoretic approach. A systematic construction of protographs with multiple edges using combinatorial design is proposed for designing QC LDPC codes with girth greater than or equal to 14.
URI
https://ieeexplore.ieee.org/document/6034272/https://repository.hanyang.ac.kr/handle/20.500.11754/72895
ISBN
978-1-4577-0594-6; 978-1-4577-0596-0; 978-1-4577-0595-3
ISSN
2157-8095; 2157-8117
DOI
10.1109/ISIT.2011.6034272
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE