A New Transform Algorithm for Viterbi Decoding

Kuei-Ann Wen, Ting Shiun Wen, Jhing Fa Wang

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

Implementation of the Viterbi decoding algorithm has attracted a great deal of interest in many applications, but the excessive hardware/time consumptions caused by the dynamic and backtracking decoding procedures make it difficult to design efficient VLSI circuits for practical applications. A new transform algorithm for maximum likelihood decoding is derived from trellis coding and Viterbi decoding processes. Dynamic trellis search operation 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.

Original languageEnglish
Pages (from-to)764-772
Number of pages9
JournalIEEE Transactions on Communications
Volume38
Issue number6
DOIs
StatePublished - 1 Jan 1990

Fingerprint Dive into the research topics of 'A New Transform Algorithm for Viterbi Decoding'. Together they form a unique fingerprint.

Cite this