Results 1  10
of
85,560
On the asymptotic capacity of fading channels
 IEEE Trans. Inform. Theory
"... We consider a peakpower limited singleantenna flat complexGaussian fading channel where the receiver and transmitter, while fully congnizant of the distribution of the fading process, have no knowledge of its realization. Upper and lower bounds on channel capacity are derived, with special emphas ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
an expression for the “prelog”, i.e., for the asymptotic ratio between channel capacity and the logarithm of the SNR. This ratio is given by the Lebesgue measure of the set of harmonics where the spectral density of the fading process is zero. We finally demonstrate that the asymptotic dependence of channel
The Asymptotic Capacity of the DiscreteTime Poisson Channel
"... Abstract — The largeinputs asymptotic capacity of a peak and average power limited discretetime Poisson channel is derived using a new firm (nonasymptotic) lower bound and an asymptotic upper bound. The latter upper bound is based on the dual expression for channel capacity and the notion of capac ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract — The largeinputs asymptotic capacity of a peak and average power limited discretetime Poisson channel is derived using a new firm (nonasymptotic) lower bound and an asymptotic upper bound. The latter upper bound is based on the dual expression for channel capacity and the notion
On the Asymptotic Capacity of Stationary Gaussian Fading Channels
 IEEE Trans. on Inform. Theory
, 2005
"... Abstract—We consider a peakpowerlimited singleantenna flat complexGaussian fading channel where the receiver and transmitter, while fully cognizant of the distribution of the fading process, have no knowledge of its realization. Upper and lower bounds on channel capacity are derived, with specia ..."
Abstract

Cited by 62 (7 self)
 Add to MetaCart
provide an expression for the “prelog, ” i.e., for the asymptotic ratio between channel capacity and the logarithm of the SNR. This ratio is given by the Lebesgue measure of the set of harmonics where the spectral density of the fading process is zero. We finally demonstrate that the asymptotic
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 548 (19 self)
 Add to MetaCart
as the number of nodes in the network goes to infinity. It is shown that if n nodes are placed in a disc of unit area in ! 2 and each node transmits at a power level so as to cover an area of ßr 2 = (log n + c(n))=n, then the resulting network is asymptotically connected with probability one if and only
Capacity of multiantenna Gaussian channels
 EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS
, 1999
"... We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such form ..."
Abstract

Cited by 2878 (6 self)
 Add to MetaCart
We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate
Asymptotic Capacity of MultiUser MIMO Communications
"... Abstract—This paper introduces two new formulas to derive explicit capacity expressions of a class of communication schemes, which include singlecell multiuser MIMO and singleuser MIMO with multicell interference. The extension of a classical theorem from Silverstein allows us to assume a channel ..."
Abstract
 Add to MetaCart
channel Kronecker model between the base stations and the cellular terminals, provided that they all embed a large number of antennas. As an introductory example, we study the singleuser MIMO setting with multicell interference, in the downlink. We provide new asymptotic capacity formulas when single
Capacity of Fading Channels with Channel Side Information
, 1997
"... We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "waterpouring" in time, analogous to waterpouring in frequency for timeinvariant frequencysele ..."
Abstract

Cited by 579 (23 self)
 Add to MetaCart
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "waterpouring" in time, analogous to waterpouring in frequency for timeinvariant frequency
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 581 (6 self)
 Add to MetaCart
We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming
Asymptotic Capacity of Twodimensional Channels with Checkerboard Constraints
, 2002
"... A checkerboard constraint is a bounded measurable set S R , containing the origin. A binary labeling of the lattice satisfies the checkerboard constraint S if whenever t 2 Z is labeled 1, all of the other Z lattice points in the translate t + S are labeled 0. Twodimensional channels th ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
))=A (S), where (S) is the packing density of the set S. An implication is that the capacity of such checkerboard constrained channels is asymptotically determined only by the areas of the constraint and the smallest (possibly degenerate) hexagon that can be circumscribed about the constraint
Asymptotic capacity gain of transmit antenna selection
 in Proc. WNCG Symposium
, 2003
"... Antenna selection provides a lowcost low complexity solution for MIMO systems, in particular transmit antenna selection exploits partial knowledge of the channel that can be made available without excessive feedback bandwidth. In this work we explore information theoretic limits of transmit antenna ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
antenna selection for high SNR and large number of transmit antennas. We define the capacity gain as the constant term in the asymptotic expansion of the ergodic capacity with respect to the SNR. We show that this value is directly related to the channel state information (CSI) at the transmitter. We
Results 1  10
of
85,560