Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Analogue decoding of tail-biting convolutional codes based on tanner graph

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 $31
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)
Zahabi, M.R. ; XLIM/Univ. of Limoges ; Meghdadi, V. ; Cances, J.-P.

A scheme is proposed to decode a tail-biting convolutional code based on its Tanner graph, which is traditionally done using a forward-backward MAP algorithm. Therefore, decoding may be performed using a standard sum-product algorithm. With respect to decoding based on trellis, all variables in a Tanner graph are binary, which may lead to complexity reduction. A min-sum algorithm is used to decrease the analogue circuit complexity. Simulation shows there is no significant degradation compared with more complex traditional methods

Published in:

Electronics Letters  (Volume:42 ,  Issue: 20 )