Bounds on the fading number of multiple-input single-output fading channels with memory
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Geometric programming for communication systems
Communications and Information Theory
Foundations and Trends® in Networking
Optimal resource allocation in relay-assisted cellular networks with partial CSI
IEEE Transactions on Signal Processing
On the capacity of the discrete-time poisson channel
IEEE Transactions on Information Theory
On the capacity of free-space optical intensity channels
IEEE Transactions on Information Theory
On the capacity and energy efficiency of training-based transmissions over fading channels
IEEE Transactions on Information Theory
Low-SNR capacity of noncoherent fading channels
IEEE Transactions on Information Theory
Information theoretic bounds for compound MIMO Gaussian channels
IEEE Transactions on Information Theory
The fading number of multiple-input multiple-output fading channels with memory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Outage behavior of discrete memoryless channels under channel estimation errors
IEEE Transactions on Information Theory
Time-division multiplexing for green broadcasting
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Functional forwarding of channel state information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A vector generalization of Costa entropy-power inequality and applications
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Channel capacity and non-uniform signalling for free-space optical intensity channels
IEEE Journal on Selected Areas in Communications - Special issue on optical wireless communications
Noncoherent MIMO communication: Grassmannian constellations and efficient detection
IEEE Transactions on Information Theory
Capacity of optical intensity channels with peak and average power constraints
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Downlink resource allocation for OFDMA-based multiservice networks with imperfect CSI
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A vector generalization of costa's entropy-power inequality with applications
IEEE Transactions on Information Theory
Noncoherent capacity of underspread fading channels
IEEE Transactions on Information Theory
On the spectral efficiency of noncoherent doubly selective block-fading channels
IEEE Transactions on Information Theory
Throughput scaling of wireless ad hoc networks with no side information
IEEE Communications Letters
Gaussian fading is the worst fading
IEEE Transactions on Information Theory
On multipath fading channels at high SNR
IEEE Transactions on Information Theory
On the capacity of FSO links over gamma-gamma atmospheric turbulence channels using OOK signaling
EURASIP Journal on Wireless Communications and Networking
On bandlimited fading channels at high SNR
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
CT-MAC: a MAC protocol for underwater MIMO based network uplink communications
Proceedings of the Seventh ACM International Conference on Underwater Networks and Systems
Hi-index | 755.74 |
A technique is proposed for the derivation of upper bounds on channel capacity. It is based on a dual expression for channel capacity where the maximization (of mutual information) over distributions on the channel input alphabet is replaced with a minimization (of average relative entropy) over distributions on the channel output alphabet. We also propose a technique for the analysis of the asymptotic capacity of cost-constrained channels. The technique is based on the observation that under fairly mild conditions capacity achieving input distributions "escape to infinity." The above techniques are applied to multiple-antenna flat-fading channels with memory where the realization of the fading process is unknown at the transmitter and unknown (or only partially known) at the receiver. It is demonstrated that, for high signal-to-noise ratio (SNR), the capacity of such channels typically grows only double-logarithmically in the SNR. To better understand this phenomenon and the rates at which it occurs, we introduce the fading number as the second-order term in the high-SNR asymptotic expansion of capacity, and derive estimates on its value for various systems. It is suggested that at rates that are significantly higher than the fading number, communication becomes extremely power inefficient, thus posing a practical limit on practically achievable rates. Upper and lower bounds on the fading number are also presented. For single-input-single-output (SISO) systems the bounds coincide, thus yielding a complete characterization of the fading number for general stationary and ergodic fading processes. We also demonstrate that for memoryless multiple-input single-output (MISO) channels, the fading number is achievable using beam-forming, and we derive an expression for the optimal beam direction. This direction depends on the fading law and is, in general, not the direction that maximizes the SNR on the induced SISO channel. Using a new closed-form expression for the expectation of the logarithm of a noncentral chi-square distributed random variable we provide some closed-form expressions for the fading number of some systems with Gaussian fading, including SISO systems with circularly symmetric stationary and ergodic Gaussian fading. The fading number of the latter- is determined by the fading mean, fading variance, and the mean squared error in predicting the present fading from its past; it is not directly related to the Doppler spread. For the Rayleigh, Ricean, and multiple-antenna Rayleigh-fading channels we also present firm (nonasymptotic) upper and lower bounds on channel capacity. These bounds are asymptotically tight in the sense that their difference from capacity approaches zero at high SNR, and their ratio to capacity approaches one at low SNR.