Results 161 to 170 of about 2,602 (222)

On the Viterbi decoding algorithm

IEEE Transactions on Information Theory, 1969
A new interpretation of the Viterbi decoding algorithm based on the state-space approach to dyamical systems is presented. In this interpretation the optimum decoder solves a generalized regulator control problem by dynamic programming techniques.
J Omura
exaly   +2 more sources

Truncation Error Probability in Viterbi Decoding

IEEE Transactions on Communications, 1977
An upper bound on the bit error probability due to truncation of the path length in Viterbi decoding is obtained for any given convolutional code. This bound is then used to determine the path length at which the additional error probability due to truncation becomes negligible compared to the maximum likelihood decoding error probability.
Daniel J Costello
exaly   +3 more sources

Memoryless Viterbi decoder

IEEE Transactions on Circuits and Systems II: Express Briefs, 2005
The problem of survival memory management of a Viterbi decoder (VD) was solved by introducing a novel pointer implementation for the register exchange method, where a pointer is assigned to each row of memory in the survivor memory unit (SMU). The content of the pointer which points to one row of memory is altered to point to another row of memory ...
Dalia A. El-Dib, Mohamed I. Elmasry
openaire   +1 more source

Home - About - Disclaimer - Privacy