Analysis and computation of the outage probability of discrete-input block-fading channels
Files
(Published version)
Date
2007
Authors
Nguyen, D.K.
Guillen i Fabregas, A.
Rasmussen, L.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 2007 IEEE International Symposium on Information Theory, 2007, pp.1196-1200
Statement of Responsibility
Conference Name
2007 IEEE International Symposium on Information Theory (24 Jun 2007 - 29 Jun 2007 : Nice, France)
Abstract
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. ©2007 IEEE.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2007 IEEE