DocumentCode
2943187
Title
An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes
Author
Wu, Xiaofu ; You, Xiaohu ; Zhao, Chunming
Author_Institution
Lab. of Nat. Mobile Commun. Res., Southeast Univ., Nanjing
fYear
2006
fDate
9-14 July 2006
Firstpage
817
Lastpage
820
Abstract
The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth
Keywords
matrix algebra; parity check codes; girth-locating algorithm; low-density parity-check codes; parity-check matrix; quasi-cyclic LDPC codes; Bipartite graph; Circuits; Encoding; Hardware; Iterative decoding; Mobile communication; Parity check codes; Performance loss; Quantum cascade lasers; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261727
Filename
4036077
Link To Document