Skip to main content

Worst-Case Mutual Information Trajectories in Concatenated Codes with Asymptotic Interleavers

  • Chapter
Information, Coding and Mathematics

Abstract

In this paper we present preliminary results on extremal (worst and best) average mutual information values carried by the extrinsic loglikelihood under the constraint of a given mean and variance while accounting for the consistency feature of loglikelihoods. This is done in an effort to gain insight into the iterative decoding procedure without resorting to the classical “Gaussian approximation”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. D. Divsalar, S. Dolinar and F. Pollara, “Iterative Turbo Decoder Analysis Based on Density Evolution,” IEEE JSAC, May 2001.

    Google Scholar 

  2. S. ten Brink, “Convergence Behavior of iterative Decoded Parallel Concatenated Codes,” IEEE Trans. Commun. Vol. 49, No. 10, pp. 1727–1737, October 2001.

    Article  MATH  Google Scholar 

  3. S. ten Brink, “Design of Serially Concatenated Codes Based on Iterative Decoding Convergence,” Proc. 2” d and International Symposium on Turbo Codes, pp. 319–322, Brest, France, Sept. 4–7, 2000.

    Google Scholar 

  4. S. ten Brink, “Designing Iterative Decoding Schemes with Extrinsic Information Transfer Chart,” AEU-International Journal of Electronics and Communications, Vol. 54, No. 6, pp. 389–398, 2000.

    Google Scholar 

  5. S. ten Brink, “Exploiting the Chain Rule of Mutual Information for the Design of Iterative Decoding Schemes,” 39th Ann. Allerton Conf. Com. Contr. and Computing, Monticello, Illinois, October 2001.

    Google Scholar 

  6. A. Ashimkin, G. Kramer and S. ten Brink, “Code Rate the Area under Extrinsic Information Transfer Curves,” submission to: IEEE Trans. Inform. Theory, Lausanne, Switzerland, June 30-July 5, 2002.

    Google Scholar 

  7. S.-Y. Chung, T. Richardson and R. Urbanke, “Analysis of Sum Product Decoding of Low Density Parity Check Codes using Gaussian Approximations,” IEEE Trans. Inform. Theory,Feb. 2001.

    Google Scholar 

  8. J. Hagenauer, E. Offer and L. Papke, “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Trans. Inform. Theory, Vol. 42, No. 2, pp. 429–445.

    Google Scholar 

  9. T. Richardson and R. Urbanke, “Analysis and Design of Iterative Decoding Systems,” 1999 IMA Summer Program: Codes Systems and Graphical Models, Minnesota, USA, August 2–6, 1999.

    Google Scholar 

  10. T. Richardson and R. Urbanke, “An Introduction to the Analysis of Iterative Coding Systems,” preprint.

    Google Scholar 

  11. M. Peleg, “Consistency with General Symmetry,” Personal Communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Divsalar, D., Shamai, S. (2002). Worst-Case Mutual Information Trajectories in Concatenated Codes with Asymptotic Interleavers. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3585-7_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5289-9

  • Online ISBN: 978-1-4757-3585-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics