Skip to main content

Bounding Performance of LDPC Codes and Turbo-Like Codes for IEEE 802.16 Broadband Wireless Internet

  • Conference paper
Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops (ISPA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4331))

  • 536 Accesses

Abstract

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers in the application of IEEE 802.16 broadband wireless internet. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.

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

Access this chapter

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. Gallager, R.: Low Density Parity Check Codes. MIT Press, Cambridge (1963)

    Google Scholar 

  2. Berrou, C., Glavieux, A.: Near Optimum Error Correcting Coding and Decoding: Turbo-Codes. IEEE Trans. Commun. 44(10), 1261–1271 (1996)

    Article  Google Scholar 

  3. Benedetto, S., Divsalar, D., Montorsi, G., Pollara, F.: Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding. IEEE Trans. Inform. Theory 44(3), 909–926 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Divsalar, D., Dolinar, S., Pollara, F.: Transfer Function Bounds on the Performance of Turbo Codes, TDA Progress Reports 42-122., Jet Propulsion Lab (1995)

    Google Scholar 

  5. Divsalar, D.: A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes, TMO Progress Reports 42-139, Jet Propulsion Lab (1999)

    Google Scholar 

  6. Garello, R., Pierleoni, P., Benedetto, S.: Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications. IEEE J. Select. Areas Commun. 19(5), 909–926 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chung, K., Heo, J. (2006). Bounding Performance of LDPC Codes and Turbo-Like Codes for IEEE 802.16 Broadband Wireless Internet. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_107

Download citation

  • DOI: https://doi.org/10.1007/11942634_107

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49860-5

  • Online ISBN: 978-3-540-49862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics