Name
Abstract | ||
|---|---|---|
In this paper, we present a construction method of terminated non-binary
low-density parity-check (LDPC) convolutional codes. Our construction method is
an expansion of Felstrom and Zigangirov construction for non-binary LDPC
convolutional codes. The rate-compatibility of the non-binary LDPC
convolutional codes is also discussed. The proposed rate-compatible code is
designed from one single mother (2,4)-regular non-binary LDPC convolutional
code of rate 1/2. Higher-rate codes are produced by puncturing the mother code
and lower-rate codes are produced by multiplicatively repeating the mother
code. For moderate values of the syndrome former memory, simulation results
show that mother non-binary LDPC convolutional code outperform binary LDPC
convolutional codes with comparable constraint bit length. And the derived
low-rate and high-rate non-binary LDPC convolutional codes exhibit good
decoding performance without loss of large gap to the Shannon limits. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ALLERTON.2010.5706907 | Communication, Control, and Computing |
Keywords | Field | DocType |
Galois fields,convolutional codes,information theory,parity check codes,Felstrom construction,GF(2p),Shannon limits,Zigangirov construction,convolutional codes,nonbinary low-density parity-check codes,rate-compatible code,syndrome former memory,terminated LDPC | Discrete mathematics,Concatenated error correction code,Convolutional code,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Turbo code,Block code,Reed–Solomon error correction,Linear code | Journal |
Volume | ISBN | Citations |
abs/1010.0 | 978-1-4244-8215-3 | 3 |
PageRank | References | Authors |
0.41 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hironori Uchikawa | 1 | 38 | 5.56 |
| K. Kasai | 2 | 319 | 33.57 |
| Kohichi Sakaniwa | 3 | 330 | 47.69 |