A new transform algorithm for Viterbi decoding

Implementation of the Viterbi decoding algorithm has attracted a great deal of interest in many applications, but the excessive hardware/time consumption caused by the dynamic and backtracking decoding procedures make it difficult to design efficient VLSI circuits for practical applications. A transform algorithm for maximum-likelihood decoding is derived from trellis coding and Viterbi decoding processes. Dynamic trellis search operations are paralleled and well formulated into a set of simple matrix operations referred to as the Viterbi transform (VT). Based on the VT, the excessive memory accesses and complicated data transfer scheme demanded by the trellis search are eliminated. Efficient VLSI array implementations of the VT have been developed. Long constraint length codes can be decoded by combining the processors as the building blocks. >

[1]  Daniel J. Costello,et al.  Truncation Error Probability in Viterbi Decoding , 1977, IEEE Transactions on Communications.

[2]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[3]  Thomas Kailath,et al.  Locally connected VLSI architectures for the Viterbi algorithm , 1988, IEEE J. Sel. Areas Commun..

[4]  Jhing-Fa Wang,et al.  Design of VLSI implemented signal processing systems based on signal flow graph analyses , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[5]  G. David Forney,et al.  Convolutional Codes II. Maximum-Likelihood Decoding , 1974, Inf. Control..

[6]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[7]  J. K. Skwirzynski The impact of processing techniques on communications , 1985 .

[8]  Shuji Kubota,et al.  A scarce-state-transition Viterbi-decoder VLSI for bit error correction , 1987 .

[9]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[10]  S. Haykin,et al.  Maximum-likelihood receiver for low-angle tracking radar. Part 2: The nonsymmetric case , 1982 .

[11]  J. Heller,et al.  Viterbi Decoding for Satellite and Space Communication , 1971 .

[12]  Robert Mario Fano,et al.  A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.

[13]  Jau Yien Lee,et al.  Parallel processing for Viterbi algorithm , 1988 .

[14]  R. Blahut Theory and practice of error control codes , 1983 .

[15]  F. Jelinek Fast sequential decoding algorithm using a stack , 1969 .

[16]  P. Glenn Gulak,et al.  VLSI Structures for Viterbi Receivers: Part I-General Theory and Applications , 1986, IEEE J. Sel. Areas Commun..

[17]  H. T. Kung Let's Design Algorithms for VLSI Systems , 1979 .

[18]  Arun K. Sood,et al.  A Multiprocessor Architecture for the (M, L)-Algorithm Suitable for VLSI Implementation , 1986, IEEE Trans. Commun..