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 language | English |
|---|---|
| DOIs | |
| State | Published - 2014 |
| Event | 2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States Duration: 9 Feb 2014 → 14 Feb 2014 |
Conference
| Conference | 2014 IEEE Information Theory and Applications Workshop, ITA 2014 |
|---|---|
| Country/Territory | United States |
| City | San Diego, CA |
| Period | 9/02/14 → 14/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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver