A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff fo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2007-11, Vol.53 (11), p.4314-4322
Hauptverfasser:	Nguyen, K.D., Guillen i Fabregas, A., Rasmussen, L.K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Australia Block-fading channel Blocking Channels Coding, codes Constellation diagram Delay diversity Error probability Exact sciences and technology Fading Gain GSM Information theory Information, signal and communications theory Lower bounds OFDM Optimization outage probability Outages rate-diversity tradeoff Signal and communications theory Signal to noise ratio signal-to-noise ratio (SNR)-exponent Systems design Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Upper bound Wireless communication
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.
ISSN:	0018-9448 1557-9654 1557-9654
DOI:	10.1109/TIT.2007.907520