TY - JOUR
T1 - Capacity bounds for kth best path selection over generalized fading channels
AU - Hanif, Muhammad Fainan
AU - Yang, Hongchuan
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014/2
Y1 - 2014/2
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/563384
UR - http://ieeexplore.ieee.org/document/6682624/
UR - http://www.scopus.com/inward/record.url?scp=84900585643&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2013.112713.132158
DO - 10.1109/LCOMM.2013.112713.132158
M3 - Article
SN - 1089-7798
VL - 18
SP - 261
EP - 264
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 2
ER -