Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TCOMM.2014.2316174 | IEEE Transactions on Communications |
Keywords | DocType | Volume |
Encoding,Vectors,Generators,Computational complexity,Fourier transforms,Parity check codes | Journal | 62 |
Issue | ISSN | Citations |
6 | 0090-6778 | 3 |
PageRank | References | Authors |
0.41 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qin Huang | 1 | 355 | 34.55 |
| Li Tang | 2 | 3 | 0.75 |
| Shanbao He | 3 | 6 | 2.15 |
| Zixiang Xiong | 4 | 3444 | 275.03 |
| Zulin Wang | 5 | 216 | 29.63 |