Capacity Bounds for kth Best Path Selection over Generalized Fading Channels

被引：3

作者：

Hanif, Muhammad ^{[1
]}

Yang, Hong-Chuan ^{[1
]}

Alouini, Mohamed-Slim ^{[2
]}

机构：

[1] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC V8W 2Y2, Canada

[2] KAUST, Comp Elect & Math Sci & Engn CEMSE Div, Thuwal, Makkah Province, Saudi Arabia

来源：

IEEE COMMUNICATIONS LETTERS | 2014年 / 18卷 / 02期

关键词：

Ergodic capacity; convexity; order statistics; Jensen's inequality; generalized Gamma distribution;

D O I：

10.1109/LCOMM.2013.112713.132158

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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.

引用

页码：261 / 264

页数：4

共 17 条

[1]

[Anonymous], 2005, Wireless Communications

[2] Log-concave probability and its applications [J].