By Topic

Performance of the Viterbi algorithm for interleaved convolutional codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
N. Benvenuto ; Dipt. di Elettronica e Inf., Padova Univ., Italy ; L. Bettella ; R. Marchesani

This paper presents a maximum-likelihood decoder for error-burst channels with a very efficient implementation. In particular, the encoder is formed of an interleaved convolutional code with generator polynomials of the type [g(1)(DI), g(2)(DI)] (for a rate 1/2 coder), where I may assume a very high integer value. The decoder consists of the Viterbi algorithm (VA) optimized for these sparse polynomials. For a given decoded bit-error probability, the required delay time and memory requirements of this approach are more inferior by far than those of the traditional method of interleaving. Moreover, for bursts of an average length less than 1/2, this method provides better performance than the dual-mode burst-error-correcting algorithm

Published in:

IEEE Transactions on Vehicular Technology  (Volume:47 ,  Issue: 3 )