Title :
Minimum decoding trellis lengths for tail-biting convolutional codes
Author_Institution :
Wireless Network Div., Hughes Network Syst. Inc., Germantown, MD, USA
fDate :
3/30/2000 12:00:00 AM
Abstract :
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
Keywords :
convolutional codes; maximum likelihood decoding; trellis codes; circular decoding algorithm; maximum-likelihood decoding; minimum decoding trellis length; tail-biting convolutional code;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20000517
