Truncation Effects in Viterbi Decoding
نویسنده
چکیده
Practical Viterbi decoders often fall significantly short of full maximum likelihood decoding (MLD) pe;formance because of survivor truncation efiects. In this paper, we study the tradeoff between truncation length and performance loss for the two most common variations of Viterbi’s algorithm: best state decoding (BSD) and fized state decoding (FSD). We find that FSD survivors should be about twice as long as BSD survivors for comparable performance.
منابع مشابه
Minimum decoding trellis length and truncation depth of wrap-around Viterbi algorithm for TBCC in mobile WiMAX
The performance of the wrap-around Viterbi decoding algorithm with finite truncation depth and fixed decoding trellis length is investigated for tail-biting convolutional codes in the mobile WiMAX standard. Upper bounds on the error probabilities induced by finite truncation depth and the uncertainty of the initial state are derived for the AWGN channel. The truncation depth and the decoding tr...
متن کاملTruncation length for Viterbi decoding
A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR loss on the AWGN channel, due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively decrease the code’s free distance, especially at low Eb/No.
متن کاملPerformance Analysis of a Sfh/ncbfsk Communication System with Rate 1/2 Convolutional Coding in the Presence of Partial-band Noise Jamming
A performance analysis of a slow frequencyhopped, noncoherent binary frequency-shift keying (SFH/NCBFSK) communication system with rate % convolutional coding and soft decision Viterbi decoding in the presence of partial-band noise jamming is performed. The effect of additive white Gaussian noise is also considered. The system’s performance is severely degraded by partial-band noise jamming, By...
متن کاملViterbi decoding for latent words language models using gibbs sampling
This paper introduces a new approach that directly uses latent words language models (LWLMs) in automatic speech recognition (ASR). LWLMs are effective against data sparseness because of their soft-decision clustering structure and Bayesian modeling so it can be expected that LWLMs perform robustly in multiple ASR tasks. Unfortunately, implementing a LWLM to ASR is difficult because of its comp...
متن کاملcient parallel algorithm for list Viterbi decoding
There is nowadays an increasing interest in list Viterbi decoding, especially for transmission of audio and video over wireless channels. List Viterbi decoding outperforms conventional Viterbi decoding at the expense of an increase in complexity. In this paper, we propose an e cient parallel list Viterbi algorithm with lower computational complexity and memory requirements. ? 2002 Elsevier Scie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004