Cycle Structure Analysis of QC-IRA-B Codes Based on Circulant Permutation Matrices

Based on analyzing the cycle structure of QC-IRA-B codes, QC-IRA-d code was presented in another paper without analysis process in detail and this kind of code is suitable for channel coding scheme of navigation data of COMPASS. This paper analyzes the cycle structure of QC-IRA-B codes based on circulant permutation matrices. The analysis of this paper shows that some special cycle structures result in lots of low-weight code words which worsen the error-correcting performance of QC-IRA-B codes. This paper also shows why QC-IRA-d codes have good error-correcting performance.

[1]  Seungkeun Park,et al.  Partial parallel encoder for IRA codes , 2010 .

[2]  Zhixing Yang,et al.  High-Throughput QC-LDPC Decoders , 2009, IEEE Transactions on Broadcasting.

[3]  Chang-Ming Lee,et al.  Optimization of memory utilization for partially parallel QC-LDPC decoder , 2010, 2010 International Symposium On Information Theory & Its Applications.

[4]  Ning Chen,et al.  Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[6]  X.-L. Li,et al.  A Family of Generalized Constant Modulus Algorithms for Blind Equalization , 2006, IEEE Transactions on Communications.

[7]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[8]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[9]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[11]  Giuseppe Caire,et al.  Design methods for irregular repeat-accumulate codes , 2003, IEEE Transactions on Information Theory.

[12]  Jianhui Wang,et al.  QC-IRA-d Codes Based on Circulant Permutation Matrices , 2011, IEEE Communications Letters.

[13]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

[14]  Ning Chen,et al.  Memory Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[15]  J.M.F. Moura,et al.  Structured LDPC codes for high-density recording: large girth and low error floor , 2006, IEEE Transactions on Magnetics.

[16]  Jing Lei,et al.  The analysis of cycle structure for a class of quasi-cyclic LDPC codes , 2008, 2008 11th IEEE Singapore International Conference on Communication Systems.

[17]  C.-J. Richard Shi,et al.  Sliced Message Passing: High Throughput Overlapped Decoding of High-Rate Low-Density Parity-Check Codes , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[18]  J.M.F. Moura,et al.  Partition-and-shift LDPC codes , 2005, IEEE Transactions on Magnetics.

[19]  Zhongfeng Wang,et al.  A Memory Efficient Partially Parallel Decoder Architecture for Quasi-Cyclic LDPC Codes , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.