Low complexity encoding algorithm of RS-based QC-LDPC codes

Author

Mu Zhang ; Li Tang ; Qin Huang ; Zulin Wang

Author_Institution

Sch. of Electron. & Inf. Eng., Beihang Univ., Beijing, China

fYear

2014

fDate

9-14 Feb. 2014

Firstpage

1

Lastpage

4

Abstract

This paper presents a novel encoding algorithm for QC-LDPC codes constructed from Reed-Solomon codes. The encoding is performed in the transform domain via Galois Fourier transformation. Message bits are encoded in sections corresponding to sub-matrices of the parity-check matrix in the transform domain. Because of the structure of the parity-check matrices of these LDPC codes, the encoding can be easily implemented with some linear-feedback shift registers, thus efficiently reduces the hardware cost.

Keywords

Fourier transforms; Galois fields; Reed-Solomon codes; communication complexity; cyclic codes; matrix algebra; parity check codes; shift registers; Galois Fourier transformation; RS-based QC-LDPC codes; Reed-Solomon codes; linear feedback shift registers; low complexity encoding algorithm; message bits encoding; parity check matrix; transform domain; Computational complexity; Encoding; Generators; Parity check codes; Polynomials; Transforms; Galois Fourier transform; LDPC codes; RS codes; encoding complexity; matrix transformation;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and Applications Workshop (ITA), 2014

Conference_Location

San Diego, CA

Type

conf

DOI

10.1109/ITA.2014.6804249

Filename

6804249