A new transform algorithm for Viterbi decoding
- 1 June 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 38 (6) , 764-772
- https://doi.org/10.1109/26.57468
Abstract
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 blocksKeywords
This publication has 13 references indexed in Scilit:
- Design of VLSI implemented signal processing systems based on signal flow graph analysesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A scarce-state-transition Viterbi-decoder VLSI for bit error correctionIEEE Journal of Solid-State Circuits, 1987
- VLSI Structures for Viterbi Receivers: Part I--General Theory and ApplicationsIEEE Journal on Selected Areas in Communications, 1986
- The Impact of Processing Techniques on CommunicationsPublished by Springer Nature ,1985
- Maximum-likelihood receiver for low-angle tracking radar. Part 2: The nonsymmetric caseIEE Proceedings F Communications, Radar and Signal Processing, 1982
- Truncation Error Probability in Viterbi DecodingIEEE Transactions on Communications, 1977
- Convolutional codes II. Maximum-likelihood decodingInformation and Control, 1974
- Viterbi Decoding for Satellite and Space CommunicationIEEE Transactions on Communication Technology, 1971
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969
- A heuristic discussion of probabilistic decodingIEEE Transactions on Information Theory, 1963