Skip to main content

Demystifying the Fang-Buda Algorithm

Boosting the block turbo decoding

  • Chapter
Turbo Codes

Abstract

After the breakthrough caused by the introduction of Convolutional Turbo Codes (CTCs) by Berrou and Glavieux [1], extensive consolidation work has led to the publication by Joachim Hagenauer of the so-called Turbo Principle [2] The latter actually generalize the principle underlying Berrou’s Turbo Codes to the decoding of any kind of concatenated error correcting code. In 1994, one year after Berrou’s landmark paper, Pyndiah proposed to decode iteratively Forney Jr.’s Block Product Codes [3, 4], as introduced in Chapter 1 of this book as Serially Concatenated Block Codes or Block Turbo Codes (BTCs).

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon Limit Error Correcting Coding and Decoding: Turbo Codes”, in proc. IEEE International Conference on Communication, Geneva, Switzerland, May 1993, Vol. 2/3, pp. 1064–1071

    Google Scholar 

  2. J. Hagenauer, “The Turbo Principle: Tutorial Introduction and State of the Art”, in proc. International Symposium on Turbo Codes, Brest, France, 1997

    Google Scholar 

  3. Forney, G., Jr., “Burst-Correcting Codes for the Classic Bursty Channel”, in IEEE Transactions on Communications, Oct 1971, Vol. 19, Issue. 5, pp. 772–781

    Google Scholar 

  4. R. Pyndiah, A. Glavieux, A. Picart and S. Jacq, “Near Optimal Decoding of Product Codes”, in proc. IEEE GLOBECOM’94, San Francisco, Nov. — Dec. 1994, Vol 1/3, pp. 339–343

    Google Scholar 

  5. A. Berthet, A, J. Fang, F. Buda, E. Lemois, P. Tortelier, “A comparison of SISO algorithms for iterative decoding of multidimensional product codes” in proc. Vehicular Technologies Conference, Tokyo, Japan, Spring 2000, Vol. 2, pp 1021–1025

    Google Scholar 

  6. S. Lin, D. J. Costello, Jr., “Error Control Coding — Fundamentals and Applications”, Prentice-Hall, 1983

    Google Scholar 

  7. J. G. Proakis, “Digital Communications”, McGraw-Hill International Editions, Third Edition, 1995

    Google Scholar 

  8. S. Benedetto and E. Biglieri, “Principles of digital transmission with wireless applications”, Kluwer Academic Publishing, 1999

    MATH  Google Scholar 

  9. D. Chase, “A Class of Algorithms for Decoding Block Codes with Channel Measurement Information”, in IEEE Trans. Inform. Theory, Jan. 1972, Vol. IT-18, pp. 170–182

    Article  MathSciNet  MATH  Google Scholar 

  10. C. Argon and S. W. McLaughlin, “A Parallel Decoder for Low Latency Decoding of Turbo Product Codes”, in IEEE Communication Letters, Vol. 6, NO. 2, Feb 2002, pp 70–72

    Article  Google Scholar 

  11. AHA, “AHA4540 Astro-OC3 155 Mb/s Turbo Product Code Encoder/Decoder”, preliminary data sheet, http://www.aha.com

  12. Xilinx, “Parametrizable Turbo Product Code (TPC) Encoder and Decoder for Virtex-II and Virtex-II PRO”, http://www.xilinx.com/ipcenter/turbo_product_code/

  13. C-Y Huang, G-W Yu, Bin-DA Liu, A hardware design approach for merge-sorting networks, in proc. IEEE International Symposium on Circuits and Systems, Sydney, May 2001,

    Google Scholar 

  14. F. Cathoor, S. Wuytack, E. de Greef, F. Balasa, L. Nachtergaele, A. Vandecapelle, “Custom Memory Management Methodology, Exploration of Memory Organization for Embedded Multimedia System Design”, Kluwer Academic Publishers, 1998

    Google Scholar 

  15. E. Brockmeyer, A. Vandecappelle, S. Wuytack, F. Catthoor, “Low power storage cycle budget distribution tool support for hierarchical graphs”, in proc. 13th international symposium on system synthesis (ISSS), Madrid, Spain, Sept. 2000, pp. 20–22

    Google Scholar 

  16. A. Papanikolaou et al., “Global Interconnect Trade-off for technology over Memory Modules to Application Level: Case Study”, 5 th ACM/IEEE Intnl. Workshop. On System Level Interconnect Prediction, Monterey CA, April 2003

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Giulietti, A., Bougard, B., Van der Perre, L. (2004). Demystifying the Fang-Buda Algorithm. In: Turbo Codes. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0477-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0477-1_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5096-5

  • Online ISBN: 978-1-4615-0477-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics