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)

Abstract

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
Volume11
Issue number5
DOIs
Publication statusPublished - May 2012
Externally publishedYes

Fingerprint

Fading Channels
Linearity
Fading channels
Channel coding
Channel capacity
Random processes
Identically distributed
Transmitters
Infinitely Divisible Laws
Systems analysis
Joint Source-channel Coding
Nakagami-m Fading
Channel Capacity
Queuing
Decode
Zero
Error Probability
Fading
Linear Function
Transmitter

Keywords

  • 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

The deterministic time-linearity of service provided by fading channels. / Dong, Yunquan; Wang, Qing; Fan, Pingyi; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 5, 6168192, 05.2012, p. 1666-1675.

Research output: Contribution to journalArticle

Dong, Yunquan ; Wang, Qing ; Fan, Pingyi ; Letaief, Khaled. / The deterministic time-linearity of service provided by fading channels. In: IEEE Transactions on Wireless Communications. 2012 ; Vol. 11, No. 5. pp. 1666-1675.
@article{de2605f4b6dc425b85109e8bba6f62d3,
title = "The deterministic time-linearity of service provided by fading channels",
abstract = "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.",
keywords = "channel service process, Fading channels, Nakagami-m fading, time linearity",
author = "Yunquan Dong and Qing Wang and Pingyi Fan and Khaled Letaief",
year = "2012",
month = "5",
doi = "10.1109/TWC.2012.030812.102276",
language = "English",
volume = "11",
pages = "1666--1675",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - The deterministic time-linearity of service provided by fading channels

AU - Dong, Yunquan

AU - Wang, Qing

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2012/5

Y1 - 2012/5

N2 - 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.

AB - 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.

KW - channel service process

KW - Fading channels

KW - Nakagami-m fading

KW - time linearity

UR - http://www.scopus.com/inward/record.url?scp=84862824598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862824598&partnerID=8YFLogxK

U2 - 10.1109/TWC.2012.030812.102276

DO - 10.1109/TWC.2012.030812.102276

M3 - Article

AN - SCOPUS:84862824598

VL - 11

SP - 1666

EP - 1675

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 5

M1 - 6168192

ER -