article · IEEE Transactions on Information Theory · 1979
A shortened Viterbi decoding algorithm for terminated rate-1/Nconvolutional codes with hard decisions (Corresp.)
D. Gupta, Jack K. Wolf
Cited by 0Abstract and details only
Abstract
An algorithm for maximum likelihood decoding of terminated rate-1/Nconvolutional 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.
Cite this paper
Gupta, D., & Wolf, J. K. (1979). A shortened Viterbi decoding algorithm for terminated rate-1/Nconvolutional codes with hard decisions (Corresp.). IEEE Transactions on Information Theory, 25(2), 243–246. https://doi.org/10.1109/tit.1979.1056015
Gupta, D., and Jack K. Wolf. “A shortened Viterbi decoding algorithm for terminated rate-1/Nconvolutional codes with hard decisions (Corresp.).” IEEE Transactions on Information Theory, vol. 25, no. 2, 1979, pp. 243–46, https://doi.org/10.1109/tit.1979.1056015.
Gupta, D., and Jack K. Wolf. 1979. “A shortened Viterbi decoding algorithm for terminated rate-1/Nconvolutional codes with hard decisions (Corresp.).” IEEE Transactions on Information Theory 25 (2): 243–46. https://doi.org/10.1109/tit.1979.1056015.
Gupta, D. and Wolf, J.K. (1979) ‘A shortened Viterbi decoding algorithm for terminated rate-1/Nconvolutional codes with hard decisions (Corresp.)’, IEEE Transactions on Information Theory, 25(2), pp. 243–246. Available at: https://doi.org/10.1109/tit.1979.1056015.
@article{gupta1979shortened,
title = {{A shortened Viterbi decoding algorithm for terminated rate-1/Nconvolutional codes with hard decisions (Corresp.)}},
author = {Gupta, D. and Wolf, Jack K.},
journal = {IEEE Transactions on Information Theory},
volume = {25},
number = {2},
pages = {243--246},
year = {1979},
doi = {10.1109/tit.1979.1056015}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Decoding of convolutional codes using a syndrome trellis
Vladimir R. Sidorenko, Victor Zyablov · IEEE Transactions on Information Theory · 1994
Cited by 68
Low complexity algorithm for optimal hard decoding of convolutional codes
J.-C. Dany · European Personal Mobile Communications Conference (EPMCC) · 2003
Cited by 6
New optimal hard decoding of convolutional codes with reduced complexity
J.-C. Dany, Jacques Antoine, L. Husson et al. · IEEE Wireless Communications and Networking Conference · 2004
Cited by 0
Low complexity algorithm for the decoding of convolutional codes of any rate
J.-C. Dany, Jacques Antoine, L. Husson et al. · International Conference on Communications · 2004
Cited by 4
The Modified Algorithm of Viterbi Convolutional Decoding
Hadi M. Saleh, R Nikitin Oleg, A Polushin Peter · 2017
Cited by 0
An efficient maximum likelihood decoding algorithm for generalized tail biting convolutional codes including quasicyclic codes
Q. Wang, V.K. Bhargava · IEEE Transactions on Communications · 1989
Cited by 38
Low-Complexity Hybrid Algorithm for Decoding Convolutional Codes
Ziyun Fu, Haiyang Liu · IEEE International Conference on Computer and Communications (ICCC) · 2022
Cited by 2