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

Improved low complexity hybrid turbo codes and union bound analysis

Improved low complexity hybrid turbo codes and union bound analysis

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:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Turbo convolutional codes (TCC) are excellent error correcting codes for wireless channels. However, TCC decoders require large decoding complexity. Moreover, complexity of TCC decoder does not reduce even if puncturing is used to change the coding rate. Modified turbo codes require lower decoding complexity than TCC as they use multiple concatenations of simple block codes and convolutional codes. Recently, a class of modified turbo codes called low complexity hybrid turbo codes (LCHTC) and improved low complexity hybrid turbo codes (ILCHTC) have been proposed. It has been shown that LCHTC and ILCHTC achieve bit error rate (BER) which is comparable to TCC and have much lower decoding complexity. Simulation results show that BER performance of ILCHTC is better than that of LCHTC. Rate-1/3 ILCHTC achieve BER of 10−5 at bit energy-to-noise ratio (Eb/N0) of 1.9 dB, which is 0.4 dB higher than Eb/N0 for TCC adopted by third generation partnership project (3GPP). Moreover, ILCHTC and LCHTC decoders require half the number of computations as compared to those required for TCC decoder. In this study, union-bound analysis of ILCHTC is presented to investigate BER performance<10−6. For large interleaver lengths, analysis of theoretical union bound requires numerous computations. Therefore approximate analysis of union bound is derived from theoretical union bound. It is shown that the analysis of approximate union bound achieves reasonable accuracy. Moreover, approximate union bound can be evaluated with significantly less computational complexity than the theoretical union bound.

References

    1. 1)
    2. 2)
    3. 3)
      • Robertson, P., Villebrun, E., Hoeher, P.: `A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain', Proc. IEEE ICC’95, 1995, p. 1009–1013.
    4. 4)
    5. 5)
    6. 6)
      • G. Wade . (2004) Coding techniques.
    7. 7)
    8. 8)
    9. 9)
      • Ping, L., Chan, S., Yeung, K.L.: `Iterative decoding of multi-dimensional concatenated single parity check codes', Proc. IEEE ICC, 1998, p. 131–135.
    10. 10)
      • Web site: http://www.3gpp.org.
    11. 11)
    12. 12)
      • Johnson, S.J., Weller, S.R.: `Construction of irregular repeat accumulated codes', Proc. Int. Symp. on Information Theory, 2005, p. 179–183.
    13. 13)
      • Hu, X.Y., Eleftheriou, E., Arnold, D.M., Dholakia, A.: `Efficient implementation of the sum–product algorithm for decoding LDPC codes', Proc. IEEE Globecom, 2001, San Antonio, TX, p. 1036–1036.
    14. 14)
      • Berrou, C., Glavieux, A., Thitimajshima, P.: `Near Shannon Limit error-correcting coding and decoding: Turbo-codes', Proc. IEEE ICC, 1993, 2, p. 1064–1070.
    15. 15)
      • R. Johannesson , K.S. Zigangirou . (1999) Fundamentals of convolutional coding.
    16. 16)
    17. 17)
    18. 18)
    19. 19)
      • Bhise, A., Vyavahare, P.D.: `Low complexity hybrid turbo codes', Proc. IEEE WCNC 2008, March 2008, Las Vegas, p. 1525–1535.
    20. 20)
    21. 21)
      • C. Heegard , S.B. Wicker . (1999) Turbo coding.
    22. 22)
    23. 23)
    24. 24)
      • J.G. Proakis . (1995) Digital communications.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2009.0611
Loading

Related content

content/journals/10.1049/iet-com.2009.0611
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address