Low-complexity encoding of binary quasi-cyclic codes based on Galois Fourier transform

This paper presents a novel low-complexity encoding algorithm for binary quasi-cyclic (QC) codes based on matrix transformation. First, a message vector is encoded into a transformed codeword in the transform domain. Then, the transmitted codeword is obtained from the transformed codeword by the inverse Galois Fourier transform. Moreover, a simple and fast mapping is devised to post-process the transformed codeword such that the transmitted codeword is binary as well. The complexity of our proposed encoding algorithm is less than ek(n-k)log2 e+ne(log22 e+log2 e)+ n/2 elog32 e bit operations for binary codes. This complexity is much lower than its traditional complexity 2e2(n - k)k. In the examples of encoding the binary (4095, 2016) and (15500, 10850) QC codes, the complexities are 12.09% and 9.49% of those of traditional encoding, respectively.

[1]  Zixiang Xiong,et al.  Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform , 2013, IEEE Transactions on Communications.

[2]  R. Townsend,et al.  Self-orthogonal quasi-cyclic codes , 1967, IEEE Trans. Inf. Theory.

[3]  Qiuju Diao,et al.  Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets , 2012, IEEE Transactions on Information Theory.

[4]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

[5]  Patrick Fitzpatrick,et al.  Algebraic structure of quasicyclic codes , 2001, Discret. Appl. Math..

[6]  Qiuju Diao,et al.  A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes , 2012, IEEE Transactions on Information Theory.

[7]  M. Darnell,et al.  Error Control Coding: Fundamentals and Applications , 1985 .

[8]  Qiuju Diao,et al.  A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[9]  F. Preparata,et al.  Computational Complexity of Fourier Transforms over Finite Fields , 1977 .

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

[11]  J.L. Massey,et al.  Theory and practice of error control codes , 1986, Proceedings of the IEEE.

[12]  W.E. Ryan,et al.  Performance of efficiently encodable low-density parity-check codes in noise bursts on the EPR4 channel , 2004, IEEE Transactions on Magnetics.

[13]  Robert Michael Tanner,et al.  A transform theory for a class of group-invariant codes , 1988, IEEE Trans. Inf. Theory.

[14]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[15]  Lajos Hanzo,et al.  Construction of Regular Quasi-Cyclic Protograph LDPC codes based on Vandermonde Matrices , 2008, 2008 IEEE 68th Vehicular Technology Conference.

[16]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels , 2006, IEEE Transactions on Communications.

[17]  Kyeongcheol Yang,et al.  A combining method of quasi-cyclic LDPC codes by the Chinese remainder theorem , 2005, IEEE Communications Letters.

[18]  Tadao Kasami.  A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.) , 1974, IEEE Trans. Inf. Theory.