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

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish
DOIs
StatePublished - 2014
Event2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States
Duration: 9 Feb 201414 Feb 2014

Conference

Conference2014 IEEE Information Theory and Applications Workshop, ITA 2014
Country/TerritoryUnited States
CitySan Diego, CA
Period9/02/1414/02/14

Keywords

  • Galois Fourier transform
  • LDPC codes
  • RS codes
  • encoding complexity
  • matrix transformation

Fingerprint

Dive into the research topics of 'Low complexity encoding algorithm of RS-based QC-LDPC codes'. Together they form a unique fingerprint.

Cite this