Tailbiting MAP decoders

IEEE Journal on Selected Areas in Communications

Volumn 16, Issue 2, 1998, Pages 297-302

  Anderson, John B ^a,b   Hladik, Stephen M ^a,b,c,d,e  

^a IEEE   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c GE GLOBAL RESEARCH   (United States)

^d UNION COLLEGE   (United States)

^e EASTMAN KODAK COMPANY   (United States)

Author keywords

Decoding; Iterative decoding; MAP decoding; Trellis decoding

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; RANDOM PROCESSES; TRELLIS CODES;

EIGENVECTORS; ITERATIVE DECODING; MAP DECODERS;

DECODING;

EID: 0031996386     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.661117     Document Type: Article

References (6)

1. L. R. Bahl et al., "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
2. J. Hagenauer, "Source-controlled channel decoding," IEEE Trans. Commun., vol. 43, pp. 2449-2457, Sept. 1995.
3. A. S. Deif, Advanced Matrix Theory for Scientists and Engineers, 2nd ed. New York: Gordon and Breach, 1991.
4. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
5. G. Battail et al., "Replication decoding," IEEE Trans. Inform. Theory, vol. IT-25, pp. 332-345, May 1979.
6. H. H. Ma and J. K. Wolf, "On tail biting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.