Concatenated tree codes: a low-complexity, high-performance approach

Author

Ping, Li ; Wu, Keying Y.

Author_Institution

Dept. of Electron. Eng., City Univ. of Hong Kong, Kowloon, China

Volume

47

Issue

2

fYear

2001

fDate

2/1/2001 12:00:00 AM

Firstpage

791

Lastpage

799

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

Keywords

belief networks; binary codes; concatenated codes; convergence of numerical methods; graph theory; iterative decoding; linear codes; tree codes; turbo codes; LDPC codes; Tanner graphs; belief-propagation algorithm; binary linear code; concatenated tree codes; fast convergence speed; high-performance approach; hybrid recursive/nonrecursive parts; low decoding cost; low-complexity approach; low-density parity check codes; multiple constituent codes; special turbo codes; Concatenated codes; Convergence; Costs; Iterative algorithms; Iterative decoding; Multidimensional systems; Parity check codes; Performance loss; Tree graphs; Turbo codes;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.910589

Filename

910589