Progressive union bound of space-time block codes and its saddlepoint approximation

A new criterion for performance evaluation of space-time block codes, based on the progressive union bound (PUB) is proposed. The PUB is not analytically tractable, in general, but can be well approximated by a saddlepoint approximation. The improvements provided by this new approach are illustrated...

Full description

Saved in:
Bibliographic Details
Published inInternational Symposium onInformation Theory, 2004. ISIT 2004. Proceedings p. 285
Main Authors Vajapeyam, M., Geng, J., Mitra, U.
Format Conference Proceeding
LanguageEnglish
Published Piscataway NJ IEEE 2004
Subjects
Additive noise
Antenna accessories
Applied sciences
Block codes
Computer science; control theory; systems
Exact sciences and technology
Fading
Information theory
Information, signal and communications theory
Matched filters
Multipath channels
Performance analysis
Receiving antennas
Telecommunications and information theory
Transmitters
Transmitting antennas
Performance evaluation
Block code
Time code
Information theory
Online AccessGet full text

Cover

More Information
Summary:A new criterion for performance evaluation of space-time block codes, based on the progressive union bound (PUB) is proposed. The PUB is not analytically tractable, in general, but can be well approximated by a saddlepoint approximation. The improvements provided by this new approach are illustrated by comparison with other bounds. New code sets, offering improved performance at low SNR, can also be found via the new bounds.
ISBN:0780382803
9780780382800
DOI:10.1109/ISIT.2004.1365323