
On Stochastic Orders and Fast Fading Multiuser Channels with Statistical CSIT
In this paper, we investigate the ergodic capacity of fast fading Gaussi...
read it

ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States
In this paper, we consider the multichannel rendezvous problem in cognit...
read it

Second Order and Moderate Deviation Analysis of a Block Fading Channel with Deterministic and Energy Harvesting Power Constraints
We consider a block fading additive white Gaussian noise (AWGN) channel ...
read it

Stabilization of Linear Systems Across a TimeVarying AWGN Fading Channel
This technical note investigates the minimum average transmit power requ...
read it

Channel Matching: An Adaptive Technique to Increase the Accuracy of Soft Decisions
Nonlinear interference is modeled by a timevarying conditionally Gaussi...
read it

A Geometric Property of Relative Entropy and the Universal Threshold Phenomenon for BinaryInput Channels with Noisy State Information at the Encoder
Tight lower and upper bounds on the ratio of relative entropies of two p...
read it

SWIPT using Hybrid ARQ over Time Varying Channels
In this work, we consider a class of wireless powered devices employing ...
read it
On a Class of TimeVarying Gaussian ISI Channels
This paper studies a class of stochastic and timevarying Gaussian intersymbol interference (ISI) channels. The i^th channel tap during time slot t is uniformly distributed over an interval of centre c_i and radius r_i. The array of channel taps is independent along both t and i. The channel state information is unavailable at both the transmitter and the receiver. Lower and upper bounds are derived on the WhiteGaussianInput (WGI) capacity C_WGI for arbitrary values of the radii r_i. It is shown that C_WGI does not scale with the average input power. The proposed lower bound is achieved by a jointtypicality decoder that is tuned to a set of candidates for the channel matrix. This set forms a net that covers the range of the random channel matrix and its resolution is optimized in order to yield the largest achievable rate. Tools in matrix analysis such as Weyl's inequality on perturbation of eigenvalues of symmetric matrices are used in order to analyze the probability of error.
READ FULL TEXT
Comments
There are no comments yet.