Results 11  20
of
85,560
Asymptotic Capacity of the TwoDimensional Square Constraint
"... Twodimensional run length limited codes satisfying the square constraint are considered. Let S denote a square of area A(S) and let ff n be a positive sequence satisfying limn!1 ff n = 1. It is shown that the capacity Cn corresponding to the set Sn = ff nS " Z 2 asymptotically satisfies l ..."
Abstract
 Add to MetaCart
Twodimensional run length limited codes satisfying the square constraint are considered. Let S denote a square of area A(S) and let ff n be a positive sequence satisfying limn!1 ff n = 1. It is shown that the capacity Cn corresponding to the set Sn = ff nS " Z 2 asymptotically satisfies
Asymptotic Capacity of TwoDimensional Channels With Checkerboard Constraints
"... constraint is a bounded measurable ..."
Gaussian interference channel capacity to within one bit
 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing o ..."
Abstract

Cited by 451 (28 self)
 Add to MetaCart
/s/Hz) of the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high signaltonoise ratio (SNR) regimes. Using our results, we provide a natural generalization of the pointtopoint classical notion of degrees of freedom to interference
Some asymptotic capacity results for MIMO wireless with and without channel knowledge at the transmitter
 Proc. 37th Asilomar Conf. Sig., Sys. and Comp
, 2003
"... Abstract – We study the asymptotic capacity of MIMO wireless channels predicated on channel knowledge (or channel state information CSI) at the transmitter in the high SNR regime. The transmitter CSI studied includes instantaneous and transmit correlation types. The receiver is assumed to know the ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract – We study the asymptotic capacity of MIMO wireless channels predicated on channel knowledge (or channel state information CSI) at the transmitter in the high SNR regime. The transmitter CSI studied includes instantaneous and transmit correlation types. The receiver is assumed to know
Capacity Limits of MIMO Channels
 IEEE J. SELECT. AREAS COMMUN
, 2003
"... We provide an overview of the extensive recent results on the Shannon capacity of singleuser and multiuser multipleinput multipleoutput (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about t ..."
Abstract

Cited by 409 (17 self)
 Add to MetaCart
We provide an overview of the extensive recent results on the Shannon capacity of singleuser and multiuser multipleinput multipleoutput (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about
Implications of rational inattention
 JOURNAL OF MONETARY ECONOMICS
, 2002
"... A constraint that actions can depend on observations only through a communication channel with finite Shannon capacity is shown to be able to play a role very similar to that of a signal extraction problem or an adjustment cost in standard control problems. The resulting theory looks enough like fa ..."
Abstract

Cited by 514 (10 self)
 Add to MetaCart
A constraint that actions can depend on observations only through a communication channel with finite Shannon capacity is shown to be able to play a role very similar to that of a signal extraction problem or an adjustment cost in standard control problems. The resulting theory looks enough like
Controlled and automatic human information processing
 I. Detection, search, and attention. Psychological Review
, 1977
"... A twoprocess theory of human information processing is proposed and applied to detection, search, and attention phenomena. Automatic processing is activation of a learned sequence of elements in longterm memory that is initiated by appropriate inputs and then proceeds automatically—without subjec ..."
Abstract

Cited by 841 (15 self)
 Add to MetaCart
—without subject control, without stressing the capacity limitations of the system, and without necessarily demanding attention. Controlled processing is a temporary activation of a sequence of elements that can be set up quickly and easily but requires attention, is capacitylimited (usually serial in nature
On the Asymptotic Capacity of MIMO Systems With Antenna Arrays of Fixed Length
 Wireless Communications, IEEE Transactions on
, 2005
"... Previous authors have shown that the asymptotic capacity of a multiple element antenna (MEA) system with transmit and receive antennas (termed an MEA) grows linearly with indices differ by if, for all, the correlation of the fading for two antenna elements whose remains fixed as antennas are added t ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Previous authors have shown that the asymptotic capacity of a multiple element antenna (MEA) system with transmit and receive antennas (termed an MEA) grows linearly with indices differ by if, for all, the correlation of the fading for two antenna elements whose remains fixed as antennas are added
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
 IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate, mini ..."
Abstract

Cited by 495 (15 self)
 Add to MetaCart
distortionrobustness tradeoffs than currently popular spreadspectrum and lowbit(s) modulation methods. Furthermore, we show that for some important classes of probabilistic models, DCQIM is optimal (capacityachieving) and regular QIM is nearoptimal. These include both additive white Gaussian noise
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. In this paper, we study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the Maxflow Mincut Theorem for network information flow. Contrary to one’s intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.
Results 11  20
of
85,560