The deterministic time-linearity of service provided by fading channels

Yunquan Dong, Qing Wang, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

18 Citations (Scopus)


In the paper, we study the service process S(t) of an independent and identically distributed (i.i.d.) Nakagami-m fading channel, which is defined as the amount of service provided, i.e., the integral of the instantaneous channel capacity over time t. By using the Moment Generation Function (MGF) approach and the infinitely divisible law, it is proved that, other than certain generally recognized curve form or a stochastic process, the channel service process S(t) is a deterministic linear function of time t, namely, S(t)=c m* · t where c m* is a constant determined by the fading parameter m. Furthermore, we extend it to general i.i.d. fading channels and present an explicit form of the constant service rate c p*. The obtained work provides such a new insight on the system design of joint source/channel coding that there exists a coding scheme such that a receiver can decode with zero error probability and zero high layer queuing delay, if the transmitter maintains a constant data rate no more than c p*. Finally, we verify our analysis through Monte Carlo simulations.

Original languageEnglish
Article number6168192
Pages (from-to)1666-1675
Number of pages10
JournalIEEE Transactions on Wireless Communications
Issue number5
Publication statusPublished - May 2012
Externally publishedYes



  • channel service process
  • Fading channels
  • Nakagami-m fading
  • time linearity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this