article · IRE Transactions on Communications Systems · 1974
Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes
Cited by 48Abstract and details only
Abstract
A recursive procedure is derived for decoding of rate <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R = 1/n</tex> binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Δ branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A "real-time," i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.
Cite this paper
Lee, L. (1974). Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes. IRE Transactions on Communications Systems, 22(2), 146–151. https://doi.org/10.1109/tcom.1974.1092169
Lee, L. “Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes.” IRE Transactions on Communications Systems, vol. 22, no. 2, 1974, pp. 146–51, https://doi.org/10.1109/tcom.1974.1092169.
Lee, L. 1974. “Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes.” IRE Transactions on Communications Systems 22 (2): 146–51. https://doi.org/10.1109/tcom.1974.1092169.
Lee, L. (1974) ‘Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes’, IRE Transactions on Communications Systems, 22(2), pp. 146–151. Available at: https://doi.org/10.1109/tcom.1974.1092169.
@article{lee1974real,
title = {{Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes}},
author = {Lee, L.},
journal = {IRE Transactions on Communications Systems},
volume = {22},
number = {2},
pages = {146--151},
year = {1974},
doi = {10.1109/tcom.1974.1092169}
}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
High-Speed Viterbi Decoder
Mário Pereira Véstias · Advances in information quality and management · 2020
Cited by 0
Performance improvement of Viterbi and Sova decoding Algorithms with finite decoding length
Mohammad Salim, Aditya Bohra · International Conference on Recent Advances in Microwave Theory and Applications · 2008
Cited by 0
Exact analysis of bit error probability for 4-state soft decision Viterbi decoding
H. Yoshikawa, Ikuo Oka, Chikato Fujiwara · IEEE International Symposium on Information Theory (ISIT) · 2002
Cited by 12
Viterbi Decoder in Hardware
Mário Pereira Véstias · Advances in computer and electrical engineering book series · 2018
Cited by 0
Viterbi Decoder in Hardware
Mário Pereira Véstias · IGI Global eBooks · 2017
Cited by 0
A reduced-state Viterbi algorithm for blind sequence estimation of DPSK sources
Tongtong Li, Zhi Jun Ding · Globecom · 1999
Cited by 2
Modified soft output viterbi algorithm for truncated trellis
G.N. Varma, G.P. Charan, U. Sahu · IEEE Region 10 Conference (TENCON) · 2004
Cited by 1