Fast Chase algorithm with an application in turbo decoding

IEEE Transactions on Communications

Volumn 49, Issue 10, 2001, Pages 1693-1699

  Hirst, Simon A ^a   Honary, Bahram ^a   Markarian, Garik ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b Advanced Hardware Architectures (AHA) Ltd   (United Kingdom)

Author keywords

Hamming codes; Linear codes; MAP estimation; Maximum likelihood decoding; Product codes

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTATION THEORY; DECODING; MAXIMUM LIKELIHOOD ESTIMATION;

TURBO PRODUCT CODES (TPC);

TURBO CODES;

EID: 0035481846     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.957387     Document Type: Article

References (16)

1. Near optimum error correcting coding and decoding: Turbo-codes
2. Optimal decoding of linear codes for minimizing symbol error rate
3. Efficient maximum likelihood decoding of linear block codes using a trellis
4. Iterative decoding of binary block and convolutional codes
5. Comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
6. Near-optimum decoding of product codes: Block turbo codes
7. Soft-input soft-output decoding of linear block codes based on ordered statistics
8. A class of algorithms for decoding block codes with channel measurement information
9. Novel near maximum likelihood soft decision decoding algorithm for linear block codes
10. On maximum likelihood soft-decision decoding of binary linear codes
11. Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
12. An improvement of soft-decision maximum likelihood decoding algorithm using hard-decision bounded-distance decoding
13. An efficient algorithm for soft-decision decoding of the (24,12) extended Golay code
14. On generalized low-density parity-check codes based on Hamming component codes
15. Good error-correcting codes based on very sparse matrices