TY - JOUR
T1 - Concatenated tree codes
T2 - A low-complexity, high-performance approach
AU - Ping, L.
AU - Wu, K. Y.
PY - 2001/2
Y1 - 2001/2
N2 - 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.
AB - 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.
KW - Bayesian networks
KW - Graph codes
KW - Iterative decoding
KW - Low-density parity-check (LDPC) codes
KW - Multidimensional concatenated codes
KW - Tanner graphs
KW - Turbo codes
UR - http://www.scopus.com/inward/record.url?scp=0035246482&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0035246482&origin=recordpage
U2 - 10.1109/18.910589
DO - 10.1109/18.910589
M3 - RGC 21 - Publication in refereed journal
SN - 0018-9448
VL - 47
SP - 791
EP - 799
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 2
ER -