Name
Abstract | ||
|---|---|---|
For cyclic LDPC codes, we propose to use their automorphism groups to improve the iterative decoding performance. The basic idea is to construct nonequivalent parity-check matrices via column permutations. Three types of iterative decoders are devised to take advantage of the code's automorphism group. In this paper we focus on cyclic LDPC codes defined by a circulant parity-check matrix and consider two known subgroups of the automorphism group of a cyclic code. For the large class of idempotent-based cyclic LDPC codes in the literature, we show that the two subgroups only provide equivalent parity-check matrices and thus cannot be harnessed for iterative decoding. Towards exploiting the automorphism group of a code, we propose a new class of cyclic LDPC codes based on pseudo-cyclic MDS codes with two information symbols, for which nonequivalent parity-check matrices are obtained. Simulation results show that for our constructed codes of short lengths, the automorphism group can significantly enhance the iterative decoding performance. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TCOMM.2013.032713.120050 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Iterative decoding,Decoding,Schedules,Complexity theory,Vectors,Polynomials | Discrete mathematics,Concatenated error correction code,Combinatorics,Group code,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Block code,Cyclic code,Linear code,List decoding | Journal |
Volume | Issue | ISSN |
61 | 6 | 0090-6778 |
Citations | PageRank | References |
2 | 0.38 | 24 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Chen | 1 | 2032 | 185.26 |
| Baoming Bai | 2 | 353 | 63.90 |
| Xinquan Yang | 3 | 6 | 0.95 |
| Li Li | 4 | 76 | 24.03 |
| Yang Yang | 5 | 2 | 0.38 |