Skip to main content
Springer Nature Link
Log in

A High-Efficient Distance Spectrum Algorithm for Turbo Codes

  • Conference paper
Information Computing and Applications (ICICA 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 391))

Included in the following conference series:

  • 1585 Accesses

Abstract

A high-efficient distance spectrum calculation approach for turbo code is proposed in this paper. It uses periodic characteristic of recursive systematic code in turbo codes to define a fundamental period. The distance spectrum can be calculated with leadfrog method by utilizing the fundamental period look-up table instead of using bit-by-bit basis calculation. The error patterns can be classified into groups of turbo codewords in term of the different fundamental periods. Thus, the computational time of distance spectrum can be reduced dramatically. Simulation results show that the proposed algorithm is applicable to turbo codes with the block length as large as eight thousand bits with a reasonable computational time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-codes. In: Proc. IEEE Int. Commun. Conf. Geneva, Switzerland, pp. 1064–1070 (1993)

    Google Scholar 

  2. Trifina, L.: Two Methods to Increase the Minimum Distance for Turbo Codes with QPP Interleavers. In: IEEE International Symposium on Signals, Circuits and Systems, pp. 1–4. IEEE Press, New York (2009)

    Google Scholar 

  3. Trifina, L., Gherca, L., Lupu, B., Rotopanescu, A.-M.: Modified Ω’ Metric for QPP Interleavers Depending on SNR. In: IEEE International Symposium on Signals, Circuits and Systems, pp. 1–4. IEEE Press, New York (2009)

    Google Scholar 

  4. Garello, R., Pierleoni, P., Benetto, S.: Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications. IEEE J. Sel. Areas Commun. 19, 800–812 (2001)

    Article  Google Scholar 

  5. Rouanne, M., Costello, D.J.: An Algorithm for Computing the Distance Spectrum of Trellis Codes. IEEE J. Sel. Areas Commun. 7(6), 929–940 (1989)

    Article  MATH  Google Scholar 

  6. Perez, L.C., Seghers, J., Costello, D.J.: A Distance Spectrum Interpretation of Turbo Codes. IEEE Trans. Inf. Theory 42(6), 1698–1709 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Breiling, M., Huber, J.: A Method for Determining the Distance Profile of Turbo Codes. In: Proc. Third ITG Conf. on Source and Channel Coding, pp. 219–224 (2000)

    Google Scholar 

  8. Scalise, S., Bae, Y.K., Ernst, H.: A Fast Algorithm to Estimate the Distance Spectrum of Turbo Codes. In: Int. Conf. Telecomm. pp. 90–95 (2003)

    Google Scholar 

  9. Wu, Y., Ogiwara, H.: Symbol-interleaver Design for Turbo Trellis-Coded Modulation. IEEE Commun. Lett. 8, 632–634 (2004)

    Article  Google Scholar 

  10. Sakai, T., Shibata, K.: A Distance Spectrum Estimation Method of Turbo Codes. In: Int. Symp. on Inf. Theory and its Applic., Auckland, New Zealand (2008)

    Google Scholar 

  11. Benedetto, S., Montorsi, G.: Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes. IEEE Trans. Inf. Theory, 409–428 (1996)

    Google Scholar 

  12. Cedervall, M.L., Johannesson, R.: A Fast Algorithm for Computing Distance Spectrum of Convolutional Codes. IEEE Trans. Inf. Theory 35, 1146–1159 (1989)

    Article  MATH  Google Scholar 

  13. Matuz, B.: On the Distance Spectrum of Tail-Biting Repeat-Accumulate Codes. IEEE Commun. Lett. 16, 518–521 (2012)

    Article  Google Scholar 

  14. Zhou, H., Mitchell, D.G.M., Goertz, N., Costello, D.J.: Distance Spectrum Estimation of LDPC Convolutional Codes. In: IEEE International Symposium on Information Theory, pp. 1–4. IEEE Press, New York (2012)

    Google Scholar 

  15. Ould-Cheikh-Mouhamedou, Y.: A Simple and Efficient Method for Lowering the Error Floors of Turbo Codes that Use Structured Interleavers, vol. 16, pp. 392–395 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, National Kaohsiung Normal University, Yanchao, Kaohsiung, 824, Taiwan

    Sun-Ting Lin

  2. Department of Computer and Communication Engineering, National Kaohsiung First University of Science and Technology, Nanzih, Kaohsiung, 811, Taiwan

    Shou-Sheu Lin

Authors
  1. Sun-Ting Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shou-Sheu Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, 800 Dongchuan Road, Dianxinqunlou 1-401, 200240, Shanghai, China

    Yuhang Yang

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, 639798, Singapore, Singapore

    Maode Ma

  3. College of Science, Hebei United University, 063009, Tangshan, Hebei, China

    Baoxiang Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, ST., Lin, SS. (2013). A High-Efficient Distance Spectrum Algorithm for Turbo Codes. In: Yang, Y., Ma, M., Liu, B. (eds) Information Computing and Applications. ICICA 2013. Communications in Computer and Information Science, vol 391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53932-9_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53932-9_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53931-2

  • Online ISBN: 978-3-642-53932-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics