Capacity bounds for kth best path selection over generalized fading channels

Muhammad Fainan Hanif, Hongchuan Yang, Mohamed-Slim Alouini

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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.
Original languageEnglish (US)
Pages (from-to)261-264
Number of pages4
JournalIEEE Communications Letters
Issue number2
StatePublished - Feb 2014

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Capacity bounds for kth best path selection over generalized fading channels'. Together they form a unique fingerprint.

Cite this