Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform Academic Article

abstract

• This paper presents two novel low-complexity encoding algorithms for quasi-cyclic (QC) codes based on Galois Fourier transform. The key idea behind them is making use of the block diagonal structure of the transformed generator matrix. The first one, named encoding by Galois Fourier transform, is equivalent to the fast implementations of the traditional encoding by Galois Fourier transform. The second one, named encoding in the transform domain (ETD), requires much less computational complexity for encoding binary QC codes. It skips the first step of the first algorithm and applies post-processing to save a large number of Galois field multiplications. Its application to QC-LDPC codes is also studied in this paper. Particularly, the hardware cost of the ETD for RS-based LDPC codes can be greatly reduced by short linear-feedback shift registers. 1972-2012 IEEE.

authors

• Xiong, Zixiang

published proceedings

• IEEE TRANSACTIONS ON COMMUNICATIONS

author list (cited authors)

• Huang, Q., Tang, L. i., He, S., Xiong, Z., & Wang, Z.

citation count

• 44

complete list of authors

• Huang, Qin||Tang, Li||He, Shanbao||Xiong, Zixiang||Wang, Zulin

publication date

• June 2014

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON COMMUNICATIONS  Journal

keywords

• Encoding Complexity
• Galois Fourier Transform (gft)
• Low-density Parity-check (ldpc) Codes
• Matrix Transformation
• Quasi-cyclic (qc) Codes
• Redundant Rows

Digital Object Identifier (DOI)

• 10.1109/TCOMM.2014.2316174

start page

• 1757

end page

• 1767

volume

• 62

issue

• 6

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ftcomm.2014.2316174