Analysis and computation of the outage probability of discrete-input block-fading channels
2007 (English)In: 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, 1196-1200 p.Conference paper (Other academic)
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. In this paper, we propose a tight lower bound to the outage probability of Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.
Place, publisher, year, edition, pages
2007. 1196-1200 p.
IdentifiersURN: urn:nbn:se:kth:diva-62626DOI: 10.1109/ISIT.2007.4557386ISI: 000257010201071OAI: oai:DiVA.org:kth-62626DiVA: diva2:480786
IEEE International Symposium on Information Theory. Nice, FRANCE. JUN 24-29, 2007
QC 201203072012-01-192012-01-192012-03-07Bibliographically approved