High-speed VLSI architectures for soft-output viterbi decoding

During the last years decoding algorithms that make not only use of soft quantized inputs but also deliver soft decision outputs have attracted considerable attention because additional coding gains are obtainable in concatenated systems. A prominent member of this class of algorithms is the Soft-Output Viterbi Algorithm. In this paper two architectures for high speed VLSI implementations of the Soft-Output Viterbi-Algorithm are proposed and area estimates are given for both architectures. The well known trade-off between computational complexity and storage requirements is played to obtain new VLSI architectures with increased implementation efficiency. Area savings of up to 40% in comparison to straightforward solutions are reported.

[1]  H. Meyr,et al.  High-speed parallel Viterbi decoding: algorithm and VLSI-architecture , 1991, IEEE Communications Magazine.

[2]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[3]  Keshab K. Parhi,et al.  Pipeline interleaving and parallelism in recursive digital filters. I. Pipelining using scattered look-ahead and decomposition , 1989, IEEE Trans. Acoust. Speech Signal Process..

[4]  H. Meyr,et al.  Soft-output Viterbi decoding: VLSI implementation issues , 1993, IEEE 43rd Vehicular Technology Conference.

[5]  Ivan M. Onyszchuk.  Truncation length for Viterbi decoding , 1991, IEEE Trans. Commun..

[6]  Robert Cypher,et al.  Generalized trace-back techniques for survivor memory management in the Viterbi algorithm , 1993, J. VLSI Signal Process..

[7]  Keshab K. Parhi,et al.  Pipeline interleaving and parallelism in recursive digital filters. II. Pipelined incremental block filtering , 1989, IEEE Trans. Acoust. Speech Signal Process..

[8]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[9]  A.J. Viterbi,et al.  Wireless digital communication: a view based on three lessons learned , 1991, IEEE Communications Magazine.

[10]  Peter Adam Hoeher.  TCM on frequency-selective fading channels: a comparison of soft-output probabilistic equalizers , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

[12]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[13]  Jens Sparsø,et al.  Design of a Fully Parallel Viterbi Decoder , 1991, VLSI.

[14]  C. Rader.  Memory Management in a Viterbi Decoder , 1981, IEEE Trans. Commun..

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

[16]  Jens Sparsø,et al.  An area-efficient path memory structure for VLSI implementation of high speed Viterbi decoders , 1991, Integr..

[17]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[18]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .