Abstract
In this paper we will give a brief overview of recent work on generalizations of the classic Viterbi Algorithm (VA) in different types of communication systems which include concatenated coding schemes. We will illustrate the usefulness of the algorithms by giving applications to speech and data transmission in radio systems. Mainly two classes of algorithms will be considered, namely list output VA or LVA and soft symbol output VA or SOVA. The LVA gives a list of the most likely output sequences while the SOVA gives the most likely sequence appended by output symbol reliability information. The additional list or soft symbol information is then processed by the next decoding stage. We will show how gains in power and/or bandwidth are obtained with list and soft output VA over schemes with a conventional hard sequence output, at the expense of increased signal processing cost. In applications where power and bandwidth are limited resources, this seems to be a reasonable path for future systems, since signal processing cost is expected to fall.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. J. Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Trans. on Inf. Theory, Vol. IT-13, pp. 260–269, 1967.
A. J. Viterbi and J. K. Omura, “Principles of Digital Communication and Coding,” McGraw-Hill, NY, 1979.
G. D. Forney, Jr., “Convolutional Codes II: Maximum Likelihood Decoding,” Inf. Control, 25, pp. 222–266, July 1974.
G. D. Forney, Jr., “Convolutional Codes III: Sequential Decoding,” Inf. Control, 25, pp. 267–297, July 1974.
H. Yamamoto and K. Itoh, “Viterbi Decoding Algorithm for Convolutional Codes with Repeat Request,” IEEE Trans. Inf. Theory, IT-26, pp. 540–547, September 1980.
T. Hashimoto, “A List-Type Reduced-Constraint Generalization of the Viterbi Algorithm,” IEEE Trans. Inf. Theory, IT-33, pp. 866–876, November 1987.
J. B. Anderson and S. Mohan, “Sequential Coding Algorithms: A Survey and Cost Analysis,” IEEE Trans. Commun., Vol. COM-32, pp. 169–176, Feb. 1984.
R. H. Deng and D. J. Costello, Jr., “High Rate Concatenated Coding Systems Using Bandwidth Efficient Trellis Inner Codes,” Dept. of Electr. and Computer Eng. Univ. of Notre Dame, Notre Dame, IN 46556, May 1987. Private Communication.
J. Hagenauer and P. Hoeher, “A Viterbi Algorithm with Soft-Decision Outputs and its Applications,” GLOBECOM '89, Dallas, Texas, Nov. 1989, Conf. Rec. pp. 1680–1686.
J. Hagenauer, P. Hoeher and J. Huber, “Soft-Output Viterbi and Symbol-by-Symbol MAP Decoding: Algorithms and Applications,” In submission to IEEE Trans. on Com.
N. Seshadri and C-E. W. Sundberg, “List Viterbi Decoding Algorithms with Applications,” In submission to IEEE Trans. on Com.
N. Seshadri and C-E. W. Sundberg, “Performance of the Generalized Viterbi Algorithm for Hybrid FEC/ARQ Data Transmission,” Conf. Rec. 24th Conf. on Information Sciences and Systems, pp. 471–476, Princeton, NJ, March 1990.
W. C. Wong, N. Seshadri and C-E. W. Sundberg, “Estimation of Unreliable Packets in Sub-band Coding of Speech,” Proceedings of the IEE, Part I, January 1991.
N. Seshadri and C-E. W. Sundberg, “Generalized Viterbi Algorithms for Error Detection with Convolutional Codes,” Conf. Rec. Globecom '89, pp. 1534–1538, Dallas, Texas, Nov. 1989. Also in submission to IEEE Trans. on Com.
F. K. Soong and E. F. Huang, “A Tree-Trellis Based Fast Search Algorithm for Finding the N Best Sentence Hypotheses in Continuous Speech Recognition,” Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, 1991, pp. 705–708.
C. H. Lee and L. R. Rabiner, “A Network-Based Frame Synchronous Level Building Algorithm for Connected Word Recognition,” Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, 1988, pp. 410–413.
G. Clark and R. Davis, “Two Recent Applications of Error-Correcting Coding to Communications System Design,” IEEE Trans. on Com., pp. 856–863, Oct. 1971.
G. Battail, “Weighting the Symbols Decoded by the Viterbi Algorithm,” IEEE Int. Symp. Inform. Theory., Ann Arbor, Calif., p. 141 (abstract), Oct. 1986.
G. Battail, “Building Long Codes by Combination of Simple Ones, Thanks to Weighted-Output Decoding,” in Proc. URSI ISSSE, Erlangen, pp. 634–637, Sept. 1989.
J. Huber and A. Rueppel, “Reliability Estimation for Symbols Detected by Trellis Decoders,” (in German), AEU, Vol. 44, pp. 8–21, Jan./Feb. 1990.
W. Koch and A. Baier, “Optimum and Sub-Optimum Detection of Coded Data Disturbed by Time-Varying Intersymbol Interference,” in Proc. GLOBECOM'90, San Diego, Calif., pp. 807.5.1–807.5.6, Dec. 1990.
P. Hoeher, “TCM on Frequency-Selective Fading Channels: A Comparison of Soft-Output Probabilistic Equalizers,” in Proc. GLOBECOM'90, San Diego, Calif., pp. 401.4.1–401.4.6., Dec. 1990.
N. Seshadri, “Joint Data and Channel Estimation Using Fast Blind Trellis Search Techniques,” Globecom 90, December 3–5, San Diego. Conference Record, pp. 1659–1663, also in submission to IEEE Trans. on Com.
C-E. W. Sundberg and N. Seshadri, “Digital Cellular Systems for North America,” GLOBECOM'90, San Diego, Dec. 1990, Conf. Rec., pp. 533–537.
Q. Wang and V. K. Bhargava, “An Efficient Maximum Likelihood Decoding Algorithm for Generalized Tailbiting Convolutional Codes,” IEEE Trans. on Com., pp. 875–879, August 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag
About this paper
Cite this paper
Sundberg, CE.W. (1992). Generalizations of the Viterbi Algorithm with applications in radio systems. In: Hagenauer, J. (eds) Advanced Methods for Satellite and Deep Space Communications. Lecture Notes in Control and Information Sciences, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036050
Download citation
DOI: https://doi.org/10.1007/BFb0036050
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55851-4
Online ISBN: 978-3-540-47299-5
eBook Packages: Springer Book Archive