By Topic

Low complexity algorithm for the decoding of convolutional codes of any rate

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

6 Author(s)
J. -C. Dany ; Radio Dept., SUPELEC, Gif-Yvette, France ; J. Antoine ; L. Husson ; A. Wautier
more authors

It is well known that convolutional codes can be optimally decoded by using the Viterbi algorithm (VA). A decoding technique where the VA is applied to identify the error vector rather than the information message is proposed. We previously focused on convolutional coders of rate 1/2 . The method to codes of any rate is generalized and shows that, with the proposed type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, performance close to optimum is achievable with a significant reduction of complexity. The higher the SNR, the greater the improvement for reduction in complexity. For instance, for SNR greater than 3 dB, a five fold reduction in complexity for the computation of ACS (add compare select) is achieved.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:1 )

Date of Conference:

20-24 June 2004