Semi-random Construction of Rate-Compatible Low-Density Parity-Check Codes

This paper presents a semi-random construction of rate-compatible low-density parity-check (LDPC) codes. We analyze some crucial properties determining the performance of LDPC codes to direct our construction approach. The new parity-check matrices corresponding to lower-rate codes are generated by...

Full description

Saved in:
Bibliographic Details
Published in2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07) p. 36
Main Authors Liang Chen, Songyan Wu, Shijun Yan, Ziyu Wu, Wenjun Zhang, Yunfeng Guan
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2007
Subjects
Computational modeling
Decoding
Equations
Image communication
Information analysis
Information processing
Message passing
Parity check codes
Performance analysis
Sparse matrices
Online AccessGet full text
DOI10.1109/ICWMC.2007.81

Cover

More Information
Summary:This paper presents a semi-random construction of rate-compatible low-density parity-check (LDPC) codes. We analyze some crucial properties determining the performance of LDPC codes to direct our construction approach. The new parity-check matrices corresponding to lower-rate codes are generated by computer search which is subject to these important properties. The novel construction approach is flexible as we only add new rows with certain constraints to the original parity-check matrix. The simulation results demonstrate that rate-compatible LDPC codes based on this approach work quite well.
DOI:10.1109/ICWMC.2007.81