A New Transform Algorithm for Viterbi Decoding

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

    研究成果: Article同行評審

    9 引文 斯高帕斯(Scopus)

    摘要

    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.

    原文English
    文章編號57468
    頁(從 - 到)764-772
    頁數9
    期刊IEEE Transactions on Communications
    38
    發行號6
    DOIs
    出版狀態Published - 6月 1990

    指紋

    深入研究「A New Transform Algorithm for Viterbi Decoding」主題。共同形成了獨特的指紋。

    引用此