DocumentCode :
929837
Title :
A shortened Viterbi decoding algorithm for terminated rate- 
convolutional codes with hard decisions (Corresp.)
convolutional codes with hard decisions (Corresp.)Author :
Gupta, Dev V. ; Wolf, Jack K.
Volume :
25
Issue :
2
fYear :
1979
fDate :
3/1/1979 12:00:00 AM
Firstpage :
243
Lastpage :
246
Abstract :
An algorithm for maximum likelihood decoding of terminated rate-1/ 
convolutional codes with hard decisions is presented which is based upon, but is simpler than, the Viterbi algorithm. The algorithm makes use of an algebraic description of convolutional codes introduced by Massey et al. For reasonable values of the probability of error, the algorithm is shown to produce substantial savings in decoding complexity compared with the Viterbi algorithm.
convolutional codes with hard decisions is presented which is based upon, but is simpler than, the Viterbi algorithm. The algorithm makes use of an algebraic description of convolutional codes introduced by Massey et al. For reasonable values of the probability of error, the algorithm is shown to produce substantial savings in decoding complexity compared with the Viterbi algorithm.Keywords :
Convolutional codes; Viterbi decoding; Block codes; Convolutional codes; Filters; Helium; Maximum likelihood decoding; Polynomials; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1979.1056015
Filename :
1056015
Link To Document :
