By Topic

Minimum decoding trellis lengths for tail-biting 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
$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

1 Author(s)
Wonjin Sung ; Wireless Network Div., Hughes Network Syst. Inc., Germantown, MD, USA

Circular decoding is a simple decoding algorithm for tail-biting convolutional codes that essentially achieves maximum-likelihood decoding performance. An investigation into the minimum required length of the decoding trellis for circular decoding is presented for optimum free-distance codes of rates 1/2, 1/3 and 1/4

Published in:

Electronics Letters  (Volume:36 ,  Issue: 7 )