Progressive union bound of space-time block codes and its saddlepoint approximation
M Vajapeyam, J Geng, U Mitra - … onInformation Theory, 2004 …, 2004 - ieeexplore.ieee.org
M Vajapeyam, J Geng, U Mitra
International Symposium onInformation Theory, 2004. ISIT 2004 …, 2004•ieeexplore.ieee.orgA 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.
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.
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.
ieeexplore.ieee.org
Showing the best result for this search. See all results