Skip to main content

An Expurgated Union Bound for Space-Time Code Systems

  • Conference paper
Telecommunications and Networking - ICT 2004 (ICT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3124))

Included in the following conference series:

Abstract

The performance of multiple-input-multiple-output (MIMO) systems over flat fading channels by calculating the Union Bound (UB) was analyzed. Based on the original idea of Verdu’s theorem, a new tighter UB by excluding the redundant code-matrices is introduced. The new tighter bound is calculated by the summation of the Pairwise Error Probabilities (PEPs) of code-matrices that belong to an irreducible set.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Foschini, G.: Layered space-time architecture for wireless communications in a fading environment when using multiple antennas. Bell Labs Tech. J., 41–59 (1996)

    Google Scholar 

  2. Foschini, G., Gans, M.: On limits of wireless communications in a fading environment when using multiple antennas. Wireless Pers. Comm. 6(3), 311–335 (1998)

    Article  Google Scholar 

  3. Verdu, S.: Maximum likelihood sequence detection for intersymbol interference channel: A new upper bound on error probability. IEEE Trans. Inform. Theory IT-33(1), 62–68 (1987)

    Article  MathSciNet  Google Scholar 

  4. Biglieri, E., et al.: Performance of space-time codes for a large number of antennas. IEEE Trans. on Information Theory 48(7), 1794–1803 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Biglieri, E., Caire, G., Taricco, G.: Expurgating the union bound to error probability: A generalizeation of the Verdu-Shields theorem. In: ISIT 1997, Ulm, Germany, June 1997, p. 373 (1997)

    Google Scholar 

  6. Tarokh, V., et al.: Space-time block coding for wireless communications: Performance results. IEEE J. Sel. Areas Comm. 17(5), 451–460 (1999)

    Article  Google Scholar 

  7. Paulraj, A., et al.: Introduction to Space-time wireless communications. Cambridge University Press, Cambridge (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ngo, VD., Choi, HW., Park, SC. (2004). An Expurgated Union Bound for Space-Time Code Systems. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics