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

Turbo codes extended with outer BCH code

Turbo codes extended with outer BCH code

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

The ‘error floor’ observed in several simulations with the turbo codes is verified by calculation of an upper bound to the bit error rate for the ensemble of all interleavers. Also an easy way to calculate the weight enumerator used in this bound is presented. An extended coding scheme is proposed including an outer BCH code correcting a few bit errors.

Inspec keywords: concatenated codes; error correction codes; error statistics; BCH codes; convolutional codes

Other keywords: interleavers; bit error rate; extended coding scheme; bit errors; weight enumerator; BER upper bound; error floor; turbo codes; outer BCH code; BCH code correcting

Subjects: Codes; Information theory; Other topics in statistics

References

    1. 1)
      • Andersen, J.D.: `Turbo coding for deep space applications', Proc. 1995 IEEE Int. Symp. Inf. Theory, September 1995, Whistler, Canada, p. 36.
    2. 2)
      • Berrou, C., Glavieux, A., Thitimajshima, P.: `Near Shannon limit error-correcting coding and decoding: Turbo-codes(1)', Proc. ICC '93, May 1993, p. 1064–1070.
    3. 3)
      • S. Benedetto , G. Montorsi . Design of parallel concatenated convolutional codes. IEEE Trans. Commun. , 5 , 591 - 600
    4. 4)
      • A.J. Viterbi , J.K. Omura . (1979) Principles of digital communication and coding.
    5. 5)
      • Robertson, P.: `Illuminating the structure of code and decoder for parallel concatenatedrecursive systematic (turbo) codes', Proc. GLOBECOM '94, 1994, 3, p. 1298–1303.
    6. 6)
      • Lee, P.J.: `A very efficient transfer function bounding technique on bit error ratefor Viterbi decoded, rate 1/N convolutional codes', 42-79, TDA Progress Rep., November 1984, p. 114–123.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19961383
Loading

Related content

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