DocumentCode
188894
Title
Quasi-Cyclic LDPC Codes Based on the Improved Combining Method
Author
Yuan-hua Liu ; Mei-ling Zhang ; Xin-liang Niu
Author_Institution
Sch. of Telecommun. & Inf. Eng., Xi´an Univ. of Posts & Telecommun., Xian, China
fYear
2014
fDate
11-13 Sept. 2014
Firstpage
356
Lastpage
358
Abstract
An improved combining method based on the Chinese Remainder Theorem is proposed for constructing much better quasi-cyclic (QC) LDPC codes. By carefully permuting the block columns of the parity check matrices of the component codes, a lot of QC-LDPC codes with much less short cycles and better performance can be designed. Simulation results show that at a BER of 10-6, the constructed QC-LDPC codes outperform those designed by the existing combining methods by about 1.2 dB.
Keywords
block codes; cyclic codes; matrix algebra; parity check codes; Chinese remainder theorem; QC-LDPC codes; block columns; combining method improvement; component codes; parity check matrices; performance design; quasi-cyclic LDPC codes; short cycles; Bit error rate; Decoding; Design methodology; Encoding; Iterative decoding; Simulation; Low-density parity-check codes; circulant permutation; quasi-cyclic;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (CIT), 2014 IEEE International Conference on
Conference_Location
Xi´an
Type
conf
DOI
10.1109/CIT.2014.55
Filename
6984679
Link To Document