Related papers: The Deterministic Time-Linearity of Service Provid…
This paper provides a detailed analysis of the important performance metrics like effective capacity and symbol error rate over fluctuating Nakagami-m fading channel. This distribution is obtained from the ratio of two random variables,…
In this chapter, the authors present the performance of multi-antenna selective combining decode-and-forward (SC-DF) relay networks over independent and identically distributed (i.i.d) Nakagami-m fading channels. The outage probability,…
The probability density function (PDF) and cumulative distribution function of the sum of L independent but not necessarily identically distributed Gamma variates, applicable to the output statistics of maximal ratio combining (MRC)…
In this paper, we analyze the symbol error rate (SER) of space-time network coding (STNC) in a distributed cooperative network over independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ fading channels. In this…
Utilizing relaying techniques to improve performance of wireless systems is a promising avenue. However, it is crucial to understand what type of relaying schemes should be used for achieving different performance objectives under realistic…
We consider power allocation algorithms for fixed-rate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel state information and discrete input signal constellations, under both…
This paper addresses the difficulty of characterizing the time-varying nature of fading channels. The current time-invariant models often fall short of capturing and tracking these dynamic characteristics. To overcome this limitation, we…
In this paper, fading Gaussian multiuser channels are considered. If the channel is perfectly known to the transmitter, capacity has been established for many cases in which the channels may satisfy certain information theoretic orders such…
The performance of $L$-branch scan-and-wait combining (SWC) reception systems over arbitrarily correlated and not necessarily identically distributed Nakagami-$m$ fading channels is analyzed and evaluated. Firstly, a fast convergent…
By recognizing the tremendous flexibility of the emerging fluid antenna system (FAS), which allows dynamic reconfigurability of the location of the antenna within a given space, this paper investigates the performance of a single-antenna…
Channel modeling is essential for design and performance evaluation of numerous protocols in vehicular networks. In this work, we study and provide results for largescale and small-scale modeling of communication channel in dense vehicular…
In this paper we deal with a single-antenna discrete-time flat-fading channel. The fading process is assumed to be stationary for the duration of a single data block. From block to block the fading process is allowed to be non-stationary.…
The performance of the V-BLAST approach, which utilizes successive interference cancellation (SIC) with optimal ordering, over independent Nakagami-m fading channels is studied. Systems with two transmit and n receive antennas are employed…
There are currently a plurality of capacity theories of fading channels, including the ergodic capacity for fast fading channels and outage capacity for slow fading channels. However, analyses show that the outage capacity is a…
Stochastic stability for centralized time-varying Kalman filtering over a wireles ssensor network with correlated fading channels is studied. On their route to the gateway, sensor packets, possibly aggregated with measurements from several…
Deterministic identification (DI) is addressed for Gaussian channels with fast and slow fading, where channel side information is available at the decoder. In particular, it is established that the number of messages scales as…
We show that the popular and general {\kappa}-{\mu} shad- owed fading model with integer fading parameters {\mu} and m can be represented as a mixture of squared Nakagami (or Gamma) distributions. Thus, its PDF and CDF can be expressed in…
In this paper, we propose a model for large scale fading channels via markov process. We exploit the channel delay profile and the dependency between channel states via a first order autoregressive model that cast insight to the channel…
A hard-deadline, opportunistic scheduling problem in which $B$ bits must be transmitted within $T$ time-slots over a time-varying channel is studied: the transmitter must decide how many bits to serve in each slot based on knowledge of the…
We investigate the diversity order of decode-and-forward relay selection in Nakagami-m fading, in cases where practical channel estimation techniques are applied. In this respect, we introduce a unified model for the imperfect channel…