Title :
ML decoding of block codes on their tailbiting trellises
Author :
Shankar, Priti ; Kumar, P.N.A. ; Sasidharan, K. ; Rajan, B.S.
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
Abstract :
A maximum likelihood decoding algorithm is presented for tailbiting trellises for block codes. The algorithm works in two phases. The first phase is a Viterbi decoding algorithm on the tailbiting trellis, while the second uses the A* algorithm adapted for application in this context. Results of simulations on tailbiting trellises for some block codes, indicate that this decoding algorithm is quite fast
Keywords :
Viterbi decoding; block codes; linear codes; maximum likelihood decoding; trellis codes; A* algorithm; ML decoding; Viterbi decoding algorithm; block codes; decoding algorithm; maximum likelihood decoding algorithm; tailbiting trellises; Automation; Block codes; Computer science; Convolutional codes; Costs; Maximum likelihood decoding; Phase estimation; Viterbi algorithm;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936154
