A Class of Improved Low-Density Parity-Check Codes Constructed Based on Gallager's Form

Focused on the problem that short cycles degrade the iterative decoding performance of finite length LDPC, a class of improved low density parity check (LDPC) codes constructed based on Gallager's form is designed. On the basis of keeping down the basic form of Gallager's construction, a q...

Full description

Saved in:
Bibliographic Details
Published in2006 International Conference on Communications, Circuits and Systems Vol. 2; pp. 694 - 697
Main Authors Guangen Wu, Pinyi Ren
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2006
Subjects
Analytical models
Degradation
Design engineering
Information analysis
Iterative decoding
Parity check codes
Reed-Solomon codes
Sparse matrices
Online AccessGet full text

Cover

More Information
Summary:Focused on the problem that short cycles degrade the iterative decoding performance of finite length LDPC, a class of improved low density parity check (LDPC) codes constructed based on Gallager's form is designed. On the basis of keeping down the basic form of Gallager's construction, a quasi-cyclic form is used, then the new codes are free of cycles of length 4 and have good minimum distance. Simulation results demonstrated that the improved codes are better than Gallager's codes when block length is small
ISBN:9780780395848
0780395840
DOI:10.1109/ICCCAS.2006.284750