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

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 791-799

  Ping, L ^a   Wu, K Y ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bayesian networks; Graph codes; Iterative decoding; Low density parity check (LDPC) codes; Multidimensional concatenated codes; Tanner graphs; Turbo codes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; TREES (MATHEMATICS);

BAYESIAN NETWORKS; CONCATENATED TREE CODES; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES;

ENCODING (SYMBOLS);

EID: 0035246482     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910589     Document Type: Article

References (28)

1. Low-density parity-check codes
2. A recursive approach to low complexity codes
3. Codes and iterative decoding on general graphs
4. Near Shannon limit performance of low-density parity check codes
5. Turbo decoding as an instance of Pearl's 'belief propagation' algorithm
6. Iterative decoding of compound codes by probability propagation in graphical models
7. Improved low-density parity-check codes using irregular graphs and belief propagation
8. Design of provably good low-density parity check codes
9. Comparison of constructions of irregular Gallager codes
10. Error-correcting codes that nearly saturate Shannon's bound
11. Near Shannon limit error-correcting coding and decoding: Turbo-codes
12. Multiple turbo codes
13. Unveiling turbo codes: Some results on parallel concatenated decoding schemes
14. Analysis, design, and iterative decoding of double serially concatenated codes with interleavers
15. Multidimensional turbo codes
16. On the design of low density parity-check codes within 0.0051 dB of the Shannon limit
17. Optimal decoding of linear codes for minimizing symbol error rate
18. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
19. Coding theorems for 'turbo-like' codes
20. Iterative decoding of multi-dimensional concatenated single parity check codes
21. Modified turbo codes with low decoding complexity
22. Low density parity check codes with semi-random parity check matrix
23. Zigzag codes and concatenated zigzag codes
24. Soft-input soft-output modules for the construction and distributed iterative decoding of code networks
25. A search for good convolutional codes to be used in the construction of turbo codes
26. Punctured turbo- codes for BPSK/QPSK channels
27. Factor graphs and the sum-product algorithm
28. Decoding low density parity check codes with finite quantization bits