By Topic

On the effect of truncation length on the exact performance of a convolutional code

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
$31 $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)
Lei Wei ; Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia ; Aulin, Tor ; Honghui Qi

In this correspondence, we first correct a mistake in Best et al. (1995) and then present a method to compute the exact probability of information bit error as a function of truncation length K for a rate 1/2, 2 state code, Finally, we generalize the method to compute the exact bit-error probability of the above convolutional code when the information bits are transmitted in blocks. The simulation results are compared with the analytical results and good agreement is observed

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 5 )