Capacity bounds for kth best path selection over generalized fading channels

Handle URI:
http://hdl.handle.net/10754/563384
Title:
Capacity bounds for kth best path selection over generalized fading channels
Authors:
Hanif, Muhammad Fainan; Yang, Hongchuan; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
Exact 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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Center for Uncertainty Quantification in Computational Science and Engineering (SRI-UQ); Electrical Engineering Program; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Communications Letters
Issue Date:
Feb-2014
DOI:
10.1109/LCOMM.2013.112713.132158
Type:
Article
ISSN:
10897798
Appears in Collections:
Articles; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorHanif, Muhammad Fainanen
dc.contributor.authorYang, Hongchuanen
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-08-03T11:47:14Zen
dc.date.available2015-08-03T11:47:14Zen
dc.date.issued2014-02en
dc.identifier.issn10897798en
dc.identifier.doi10.1109/LCOMM.2013.112713.132158en
dc.identifier.urihttp://hdl.handle.net/10754/563384en
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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectconvexityen
dc.subjectErgodic capacityen
dc.subjectgeneralized Gamma distributionen
dc.subjectJensen's inequalityen
dc.subjectorder statisticsen
dc.titleCapacity bounds for kth best path selection over generalized fading channelsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentCenter for Uncertainty Quantification in Computational Science and Engineering (SRI-UQ)en
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journalIEEE Communications Lettersen
dc.contributor.institutionDepartment of Electrical and Computer Engineering, University of Victoria (UVic), BC, Canadaen
kaust.authorAlouini, Mohamed-Slimen
kaust.authorYang, Hongchuanen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.