Reduced complexity iterative decoding for concatenated coding schemes

IEEE International Conference on Communications

Volumn 5, Issue , 2003, Pages 3135-3139

  Bokolamulla, Dhammika ^a   Aulin, Tor ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE METHODS; TRELLIS CODES;

ITERATIVE DECODING;

ENCODING (SYMBOLS);

EID: 0037634579     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. G. D. Forney, Jr., Concatenated Codes, Cambridge, MA: MIT Press, 1966.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error correcting coding and decoding: Turbo codes," in Proc. IEEE International Conference on Communications, pp. 1064-1070, May 1993.
3. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design and iterative decoding," IEEE Transactions on Information Theory, vol. 44, pp. 909-926, May 1998.
4. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output APP module for iterative decoding of concatenated codes," IEEE Communication Letters, vol. 1, pp. 22-24, Jan. 1997.
5. V. Franz and J. B. Anderson, "Concatenated decoding with a reduced-search BCJR algorithm," IEEE Journal on Selected Areas in Communications, vol. 16, pp. 186-195, Feb. 1998.
6. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Transactions on Information Theory, pp. 284-287, Mar. 1974.
7. J. B. Anderson and S. Mohan, "Sequential decoding algorithms: A survey and cost analysis," IEEE Trans. Communication, vol. 32, pp. 169-176, Feb. 1984.
8. S. J. Simmons, "Breadth-first trellis decoding with adaptive effort," IEEE Trans. Communication, vol. 38, pp. 3-12, Jan. 1990.
9. T. Minowa and H. Imai, "Reduced-complexity iterative decoding of high-rate turbo codes," in Proc. IEEE Global Telecommunications Conference, vol. 1, pp. 193-197, Nov. 2000.
10. G. Colavolpe, G. Ferrari, and R. Raheli, "Reduced-state BCJR-type algorithms," in Proc. IEEE International Symposium on Information Theory, p. 322, June 2000.
11. P. Thiennviboon, G. Ferrari, and K. M. Chugg, "Generalized trellis-based reduced-state soft-input/soft-output algorithms," in Proc, IEEE International Conference on Communications, vol. 3, pp. 1667-1671, May 2002.
12. R. J. McEliece and W. Lin, "The trellis complexity of convolutional codes," IEEE Transactions on Information Theory, vol. 42, pp. 1855-1864, Nov. 1996.