Show simple item record

dc.contributor.authorHanif, Muhammad Fainan
dc.contributor.authorYang, Hongchuan
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2015-08-03T11:47:14Z
dc.date.available2015-08-03T11:47:14Z
dc.date.issued2014-02
dc.identifier.issn10897798
dc.identifier.doi10.1109/LCOMM.2013.112713.132158
dc.identifier.urihttp://hdl.handle.net/10754/563384
dc.description.abstractExact ergodic capacity calculation for fading wireless channels typically involves time-consuming numerical evaluation of infinite integrals. In this paper, lower and upper bounds on ergodic capacity for kth best path are presented. These bounds have simple analytic expressions which allow their fast evaluation. Numerical results show that the newly proposed bounds closely approximate the exact ergodic capacity for a large variety of system configurations. © 1997-2012 IEEE.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectconvexity
dc.subjectErgodic capacity
dc.subjectgeneralized Gamma distribution
dc.subjectJensen's inequality
dc.subjectorder statistics
dc.titleCapacity bounds for kth best path selection over generalized fading channels
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentCenter for Uncertainty Quantification in Computational Science and Engineering (SRI-UQ)
dc.contributor.departmentElectrical Engineering Program
dc.contributor.departmentCommunication Theory Lab
dc.identifier.journalIEEE Communications Letters
dc.contributor.institutionDepartment of Electrical and Computer Engineering, University of Victoria (UVic), BC, Canada
kaust.personAlouini, Mohamed-Slim
kaust.personYang, Hongchuan


This item appears in the following Collection(s)

Show simple item record