Design LDPC codes without cycles of length 4 and 6

Authors:
Jun Fan;Yang Xiao;Kiseon Kim
Affiliations:
Office of Academic Affairs, Central University for Nationalities, Beijing, China;Institute of Information Science, Beijing Jiaotong University, Beijing, China;Department of Information and Communications, Gwangju Institute of Science and Technology, Gwangju, South Korea
Venue:
Research Letters in Communications - Regular issue
Year:
2008

Citing 2
Cited 1

Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices

IEEE Transactions on Information Theory

Girth 4 and low minimum weights' problems of LDPC codes in DVB-S2 and solutions

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach for constructing LDPC codes without cycles of length 4 and 6. Firstly, we design 3 submatrices with different shifting functions given by the proposed schemes, then combine them into the matrix specified by the proposed approach, and, finally, expand the matrix into a desired parity-check matrix using identity matrices and cyclic shift matrices of the identity matrices. The simulation result in AWGN channel verifies that the BER of the proposed code is close to those of Mackay's random codes and Tanner's QC codes, and the good BER performance of the proposed can remain at high code rates.