http://iet.metastore.ingenta.com
1887

Canonical structure for systematic rate k/n convolutional encoders and its application to turbo codes

Canonical structure for systematic rate k/n convolutional encoders and its application to turbo codes

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

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

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.

Systematic recursive convolutional encoders have been shown to play a crucial role in the design and implementation of parallel concatenated codes (‘turbo codes’). The authors present a canonical structure of minimal linear systematic rate k/n encoders and show how to use it in the search for good constituent codes of parallel concatenated codes.

References

    1. 1)
      • Convolutional Codes I: Algebraic Structure
    2. 2)
      • Thitimajshima, P.: `Systematic recursive convolutional codes and theirapplication to parallel concatenation', Dec. 1993, PhD, Université de Bretagne Occidentale, in French
    3. 3)
      • Design of parallel concatenatedconvolutional codes
    4. 4)
      • The effective free distance ofturbo codes
    5. 5)
      • The dynamics of linear codes overgroups: state spaces, trellis diagram and canonical encoders
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19960643
Loading

Related content

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