Results 1  10
of
575
Fading Channels: InformationTheoretic And Communications Aspects
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... In this paper we review the most peculiar and interesting informationtheoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information ..."
Abstract

Cited by 426 (3 self)
 Add to MetaCart
(Show Context)
In this paper we review the most peculiar and interesting informationtheoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both singleuser and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
 IEEE Transactions on Information Theory
, 2002
"... How much information can be carried over a wireless network with a multiplicity of nodes? What are the optimal strategies for information transmission and cooperation among the nodes? We obtain sharp information theoretic scaling laws under some conditions. ..."
Abstract

Cited by 362 (19 self)
 Add to MetaCart
(Show Context)
How much information can be carried over a wireless network with a multiplicity of nodes? What are the optimal strategies for information transmission and cooperation among the nodes? We obtain sharp information theoretic scaling laws under some conditions.
Nested Linear/Lattice Codes for Structured Multiterminal Binning
, 2002
"... Network information theory promises high gains over simple pointtopoint communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning sch ..."
Abstract

Cited by 345 (14 self)
 Add to MetaCart
Network information theory promises high gains over simple pointtopoint communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning scheme. Wyner and other researchers proposed various forms of coset codes for efficient binning, yet these schemes were applicable only for lossless source (or noiseless channel) network coding. To extend the algebraic binning approach to lossy source (or noisy channel) network coding, recent work proposed the idea of nested codes, or more specifically, nested paritycheck codes for the binary case and nested lattices in the continuous case. These ideas connect network information theory with the rich areas of linear codes and lattice codes, and have strong potential for practical applications. We review these recent developments and explore their tight relation to concepts such as combined shaping and precoding, coding for memories with defects, and digital watermarking. We also propose a few novel applications adhering to a unified approach.
The capacity region of the Gaussian multipleinput multipleoutput broadcast channel
 IEEE TRANS. INF. THEORY
, 2006
"... The Gaussian multipleinput multipleoutput (MIMO) broadcast channel (BC) is considered. The dirtypaper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequa ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
The Gaussian multipleinput multipleoutput (MIMO) broadcast channel (BC) is considered. The dirtypaper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is optimal for the nondegraded case. Furthermore, the capacity region is characterized under a wide range of input constraints, accounting, as special cases, for the total power and the perantenna power constraints.
Sum Capacity of a Gaussian Vector Broadcast Channel
 IEEE Trans. Inform. Theory
, 2002
"... This paper characterizes the sum capacity of a class of nondegraded Gaussian vectB broadcast channels where a singletransmitter with multiple transmit terminals sends independent information to multiple receivers. Coordinat+[ is allowed among the transmit teminals, but not among the different recei ..."
Abstract

Cited by 279 (21 self)
 Add to MetaCart
(Show Context)
This paper characterizes the sum capacity of a class of nondegraded Gaussian vectB broadcast channels where a singletransmitter with multiple transmit terminals sends independent information to multiple receivers. Coordinat+[ is allowed among the transmit teminals, but not among the different receivers. The sum capacity is shown t be a saddlepoint of a Gaussian mu al informat]R game, where a signal player chooses a tansmit covariance matrix to maximize the mutual information, and a noise player chooses a fictitious noise correlation to minimize the mutual information. This result holds fort he class of Gaussian channels whose saddlepoint satisfies a full rank condition. Furt her,t he sum capacity is achieved using a precoding method for Gaussian channels with additive side information noncausally known at the transmitter. The optimal precoding structure is shown t correspond to a decisionfeedback equalizer that decomposes t e broadcast channel into a series of singleuser channels with intk ference presubtract] at the transmiter.
Breaking Spectrum Gridlock with Cognitive Radios: An Information Theoretic Perspective
, 2008
"... Cognitive radios hold tremendous promise for increasing spectral efficiency in wireless systems. This paper surveys the fundamental capacity limits and associated transmission techniques for different wireless network design paradigms based on this promising technology. These paradigms are unified b ..."
Abstract

Cited by 265 (4 self)
 Add to MetaCart
Cognitive radios hold tremendous promise for increasing spectral efficiency in wireless systems. This paper surveys the fundamental capacity limits and associated transmission techniques for different wireless network design paradigms based on this promising technology. These paradigms are unified by the definition of a cognitive radio as an intelligent wireless communication device that exploits side information about its environment to improve spectrum utilization. This side information typically comprises knowledge about the activity, channels, codebooks and/or messages of other nodes with which the cognitive node shares the spectrum. Based on the nature of the available side information as well as a priori rules about spectrum usage, cognitive radio systems seek to underlay, overlay or interweave the cognitive radios ’ signals with the transmissions of noncognitive nodes. We provide a comprehensive summary of the known capacity characterizations in terms of upper and lower bounds for each of these three approaches. The increase in system degrees of freedom obtained through cognitive radios is also illuminated. This information theoretic survey provides guidelines for the spectral efficiency gains possible through cognitive radios, as well as practical design ideas to mitigate the coexistence challenges in today’s crowded spectrum.
Ratedistortion methods for image and video compression
 IEEE Signal Process. Mag. 1998
"... In this paper we provide an overview of ratedistortion (RD) based optimization techniques and their practical application to image and video coding. We begin with a short discussion of classical ratedistortion theory and then we show how in many practical coding scenarios, such as in standardsco ..."
Abstract

Cited by 224 (7 self)
 Add to MetaCart
In this paper we provide an overview of ratedistortion (RD) based optimization techniques and their practical application to image and video coding. We begin with a short discussion of classical ratedistortion theory and then we show how in many practical coding scenarios, such as in standardscompliant coding environments, resource allocation can be put in an RD framework. We then introduce two popular techniques for resource allocation, namely, Lagrangian optimization and dynamic programming. After a discussion of these two techniques as well as some of their extensions, we conclude with a quick review of recent literature in these areas citing a number of applications related to image and video compression and transmission. We
A Tractable Approach to Coverage and Rate in Cellular Networks
 IEEE Trans. Commun
, 2011
"... ar ..."
Towards an Information Theory of Large Networks: An Achievable Rate Region
 IEEE Trans. Inform. Theory
, 2003
"... Abstract — We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an informationtheoretic constructive scheme for obtaining an achievable rate region in such networks. Many wellknown capacitydefining achievabl ..."
Abstract

Cited by 203 (12 self)
 Add to MetaCart
(Show Context)
Abstract — We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an informationtheoretic constructive scheme for obtaining an achievable rate region in such networks. Many wellknown capacitydefining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multipleaccess channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities. Applying the proposed scheme to a specific wireless network of nodes located in a region of unit area, we show that a transport capacity of ¡£ ¢ bitmeters/sec is feasible in a certain family of networks, as compared to the best possible transport capacity ¡£¢§ ¦ ¨ ¤ of bitmeters/sec in [16] where the receiver capabilities were limited. Even though the improvement is shown for a specific class of networks, a clear implication is that designing and employing more sophisticated multiuser coding schemes can provide sizable gains in at least some large wireless networks. Index Terms — Discrete memoryless channels, Gaussian channels, multiuser communications, network information theory,