Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Minimum decoding trellis lengths for tail-biting convolutional codes

Minimum decoding trellis lengths for tail-biting convolutional codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

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.

Inspec keywords: trellis codes; maximum likelihood decoding; convolutional codes

Other keywords: maximum-likelihood decoding; circular decoding algorithm; tail-biting convolutional code; minimum decoding trellis length

Subjects: Codes

References

    1. 1)
      • H.H. Ma , J.K. Wolf . On tail biting convolutional codes. IEEE Trans. Commun. , 2 , 104 - 111
    2. 2)
      • Yehushua, M., Watson, J., Parr, M.: `System and method for decoding tail-biting code especially applicableto digitalcellular base stations and mobile units', US, 5369671, 1994.
    3. 3)
      • G.D. Forney . Convolutional codes I: Algebraic structure. IEEE Trans. , 720 - 738
    4. 4)
      • F. Hemmati , D.J. Costello . Truncation error probability in Viterbi decoding. IEEE Trans. , 5 , 530 - 532
    5. 5)
      • S. Lin , D.J. Costello . (1983) Error control coding: Fundamentals and applications.
    6. 6)
      • Cox, R.V., Sundberg, C.-E.W.: `Circular Viterbi decoder', US, 5355376, 1994.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20000517
Loading

Related content

content/journals/10.1049/el_20000517
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address