DocumentCode
787047
Title
An optimal circular Viterbi decoder for the bounded distance criterion
Author
Anderson, John B. ; Hladik, Stephen M.
Author_Institution
Inf. Technol. Dept., Lund Univ., Sweden
Volume
50
Issue
11
fYear
2002
fDate
11/1/2002 12:00:00 AM
Firstpage
1736
Lastpage
1742
Abstract
We propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder. Procedures are given that compute this minimum. Unlike previous decoders of the type, the new scheme does not suffer limit cycles or from pseudocodewords. The bit-error rate is compared to that of Bahl-Cocke-Jelinek-Raviv and maximum-likelihood decoding.
Keywords
AWGN channels; Viterbi decoding; error statistics; optimisation; trellis codes; AWGN channel; Bahl-Cocke-Jelinek-Raviv decoding; additive white Gaussian noise channel; bit-error rate; bounded distance Viterbi decoder; bounded distance criterion; maximum-likelihood decoding; optimal circular Viterbi decoder; tailbiting trellis codes; AWGN; Binary decision diagrams; Bit error rate; Code standards; Convolutional codes; Error correction codes; Iterative decoding; Limit-cycles; Maximum likelihood decoding; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2002.805263
Filename
1097884
Link To Document