Two decoding algorithms for tailbiting codes

IEEE Transactions on Communications

Volumn 51, Issue 10, 2003, Pages 1658-1665

  Shao, Rose Y ^a   Lin, Shu ^b   Fossorier, Marc P C ^c  

^a Maxtor Corporation   (United States)

^b University of California   (United States)

^c University of Hawaii at Manoa   (United States)

Author keywords

Bidirectional decoding; Circular decoding; Tailbiting codes; Tailbiting trellises; Viterbi algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DECODING; ITERATIVE METHODS; OPTIMIZATION; TRELLIS CODES;

BIDIRECTIONAL VITERBI ALGORITHM; TAILBITING CODES; WRAP-AROUND VITERBI ALGORITHM;

ALGORITHMS;

EID: 0242365687     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2003.818084     Document Type: Article

References (15)

1. G. Solomon and H. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, no. 2, pp. 358-369, Oct. 1979.
2. H. H. Ma and J. K. Wolf, "On tailbiting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.
3. Q. Wang and V. K. Bhargava, "An efficient maximum-likelihood decoding algorithm for generalized tailbiting convolutional codes including quasi-cyclic codes," IEEE Trans. Commun., vol. 37, pp. 875-879, Aug. 1989.
4. K. S. Zigangirov and V. V. Chebyshov, "Study of decoding tailbiting convolutional codes," in Proc. 4th Joint Swedish-Soviet Int. Workshop Information Theory, Gotland, Sweden, Aug. 1989, pp. 52-55.
5. R. V. Cox and C. E. Sundberg, "An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes," IEEE Trans. Veh. Technol., vol. 43, pp. 57-68, Feb. 1994.
6. J. B. Anderson and S. M. Hladik, "An optimal circular Viterbi decoder for the bounded distance criterion," IEEE Trans. Commun., vol. 50, pp. 1736-1742, Nov. 2002.
7. A. R. Calderbank, G. D. Forney, Jr., and A. Vardy, "Minimal tailbiting trellises: Golay code and more," IEEE Trans. Inform. Theory, vol. 45, pp. 1435-1455, Jul. 1999.
8. J. B. Anderson and S. M. Hladik, "Tailbiting MAP decoders," IEEE J. Select. Areas Commun., vol. 16, pp. 297-302, Feb. 1998.
9. P. Stahl, J. B. Anderson, and R. Johannesson, "Optimal and near-optimal encoders for short and moderate-length tailbiting trellises," IEEE Trans. Inform. Theory, vol. 45, pp. 2562-2571, Nov. 1999.
10. R. Y. Shao, "Decoding of linear block codes based on their tailbiting trellises and efficient stopping criteria for turbo decoding," Ph.D. dissertation, Univ. of Hawaii at Manoa, Honolulu, HI, 1999.
11. K. E. Tepe, "Topics in BCJR and Turbo Decoding, Communication, Information and Voice Processing Report Series," ECSE Dept., Renselaer Polytech. Inst., Troy, NY, Rep. TR 98-1, 1998.
12. J. B. Anderson and K. E. Tepe, "Properties of the tailbiting BCJR decoding," in Codes, Systems and Graphical Models. New York: Springer-Verlag, 2001.
13. ____, Private Communication, 1999.
14. G. D. Forney, "On iterative decoding of tailbiting codes," in Proc. 1998 Information Theory Workshop, San Diego, CA, Feb. 1998, pp. 11-12.
15. R. Johannesson and K. S. Zigangirov, Introduction to Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.