DOI Prefix : 10.9780 | Journal DOI : 10.9780/22307850
Scroll to Top

Volume : II, Issue : VII, August - 2012

The Turbo Code and an Efficient Decoder Implementation using MAP Algorithm for Software Defined Radios

Rupesh Singh and Nidhi Singh

DOI : 10.9780/22307850, Published By : Laxmi Book Publication

Abstract :

This paper provides a description of the turbo code used by the UMTS third-generation cellular standard, as standardized by the Third-Generation Partnership Project (3GPP), and proposes an efficient decoder suitable for insertion into software-defined radio or for use in computer simulations. Because the decoder is implemented in software, rather than hardware, singleprecision floating-point arithmetic is assumed and a variable number of decoder iterations is not only possible but desirable. The wellknown log-MAP decoding algorithm with detailed analysis is proposed and the simulation results are shown.

Keywords :


Article :


Cite This Article :

Rupesh Singh and Nidhi Singh, (2012). The Turbo Code and an Efficient Decoder Implementation using MAP Algorithm for Software Defined Radios. Indian Streams Research Journal, Vol. II, Issue. VII, DOI : 10.9780/22307850, http://oldisrj.lbp.world/UploadedData/1270.pdf

References :

  1. SHANNON, C. E.: 'A mathematical theory of communication', Bell Syst. Tech. J., July and October 1948, 27, pp.379–423 and 623–656.
  2. C. Berrou, A. Glavieux, and P. Thitimasjshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes(1), Proc.IEEE Int. Conf. on Commun. (Geneva, Switzerland), pp. 1064–1070, May 1993.
  3. S. Benedetto and G. Montorsi, Unveiling turbo codes: Some results on parallel concatenated coding schemes, IEEE Trans. Inform.Theory, Vol. 42, pp. 409–428, Mar. 1996.
  4. L. C. Perez, J. Seghers, and D. J. Costello, A distance spectrum interpretation of turbo codes, IEEE Trans. Inform. Theory, Vol. 42, pp. 1698–1708, Nov. 1996.
  5. D. Divsalar, S. Dolinar, and F. Pollara, Iterative turbo decoder analysis based on density evolution, IEEE J. Select. Areas Commun., Vol. 19, pp. 891–907, May 2001.
  6. S. ten Brink, Convergence behavior of iteratively decoded parallel concatenated codes, IEEE Trans. Commun., Vol. 49, pp. 1727– 1737, Oct. 2001.
  7. European Telecommunications Standards Institute, Universal mobile telecommunications system (UMTS): Multiplexing and channel coding (FDD), 3GPP TS 125.212 version 3.4.0, pp. 14–20, Sept. 23, 2000.
  8. P. Robertson, P. Hoeher, and E. Villebrun, Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding, European Trans. on Telecommun., Vol. 8, pp. 119–125, Mar./Apr. 1997
  9. ] A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding Algorithm, IEEE Trans. Inform. Theory, Vol. 13, pp. 260–269, Apr. 1967.
  10. G. D. Forney, The Viterbi algorithm, Proc. IEEE, Vol. 61, pp.268–278, Mar. 1973.
  11. European Telecommunications Standards Institute, Universal mobile telecommunications system (UMTS): Multiplexing and channel coding (FDD), 3GPP TS 125.212 version 3.4.0, pp. 14–20, Sept. 23, 2000.

Article Post Production

Article Indexed In

Comments :

Enter Name :
Email ID :
Comments :

Previous Comments :

Creative Commons License
Indian Streams Research Journal by Laxmi Book Publication is licensed under a Creative Commons Attribution 4.0 International License.
Based on a work at http://oldisrj.lbp.world/Default.aspx.
Permissions beyond the scope of this license may be available at http://oldisrj.lbp.world/Default.aspx
Copyright © 2014 Indian Streams Research Journal. All rights reserved
Looking for information? Browse our FAQs, tour our sitemap, or contact ISRJ
Read our Privacy Policy Statement and Plagairism Policy. Use of this site signifies your agreement to the Terms of Use