Name
Abstract | ||
|---|---|---|
In this letter, we show that a concatenated zigzag code can be viewed as a low-density parity-check (LDPC) code. Based on the bipartite graph representation for such a parallel-concatenated code, various sum-product based decoding algorithms are introduced and compared. The results show that the improved versions of sum-product algorithm exhibit better convergence rate while maintaining the essential parallel form. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/LCOMM.2003.822493 | IEEE Communications Letters |
Keywords | Field | DocType |
Concatenated codes,Parity check codes,Bipartite graph,Convergence,Turbo codes,Sum product algorithm,Iterative decoding,Research and development,Collaborative work,Mobile communication | Graph theory,Concatenated error correction code,Low-density parity-check code,Computer science,Bipartite graph,Serial concatenated convolutional codes,Computer network,Algorithm,Theoretical computer science,Decoding methods,Zigzag,Zigzag code | Journal |
Volume | Issue | ISSN |
8 | 1 | 1089-7798 |
Citations | PageRank | References |
3 | 0.43 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoxia Wu | 1 | 535 | 38.61 |
| Y. Xue | 2 | 3 | 0.43 |
| H. Xiang | 3 | 3 | 0.43 |