Abstract
This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special low-density parity-check (LDPC) codes consisting of several trees with large spans. They can also be regarded as special turbo codes with hybrid recursive/nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm. They combine many advantages of LDPC and turbo codes, such as low decoding cost, fast convergence speed, and good performance.
| Original language | English |
|---|---|
| Pages (from-to) | 791-799 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 47 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Feb 2001 |
Research Keywords
- Bayesian networks
- Graph codes
- Iterative decoding
- Low-density parity-check (LDPC) codes
- Multidimensional concatenated codes
- Tanner graphs
- Turbo codes
Fingerprint
Dive into the research topics of 'Concatenated tree codes: A low-complexity, high-performance approach'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver