• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 9,089
Next 10 →

The capacity region of the Gaussian multiple-input multiple-output broadcast channel

by Hanan Weingarten, Yossef Steinberg, Shlomo Shamai (Shitz) - IEEE TRANS. INF. THEORY , 2006
"... The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper 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 multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper 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

Capacity Regions for Wireless Ad Hoc Networks

by Stavros Toumpis , Andrea J. Goldsmith - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS , 2003
"... We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable-rate transmissi ..."
Abstract - Cited by 283 (16 self) - Add to MetaCart
We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable

Comments on Broadcast Channels

by Thomas M. Cover , 1998
"... The key ideas in the theory of broadcast channels are illustrated by discussing some of the progress toward finding the capacity region. The capacity region is still unknown. Index Terms---Binning, broadcast channel, capacity, degraded broadcast channel, feedback capacity, Slepian--Wolf, superposit ..."
Abstract - Cited by 572 (0 self) - Add to MetaCart
The key ideas in the theory of broadcast channels are illustrated by discussing some of the progress toward finding the capacity region. The capacity region is still unknown. Index Terms---Binning, broadcast channel, capacity, degraded broadcast channel, feedback capacity, Slepian

On the capacity region for index coding

by Fatemeh Arbabjolfaei, Bernd Bandemer, Young-han Kim, Lele Wang, et al. - IN PROC. IEEE INT. SYMP. INF. THEORY , 2013
"... A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression. Th ..."
Abstract - Cited by 13 (5 self) - Add to MetaCart
A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression

rno Capacity region

by unknown authors
"... Energy efficiency a n are d (i e fir ing t of By feeding these linear constraints into an integer programming formulation, we then propose a routing orking alizing lly hig ure of withou devices, while preserving flexibility and cost efficiency, is a great challenge not supported by current technolog ..."
Abstract - Add to MetaCart
timely manner. The key contributions of this paper are: We propose a novel way to represent the capacity region of a set of stations sharing the wireless medium, which we refer to as linearized capacity region, and compute the corresponding ⇑ Corresponding author.

rno Capacity region

by unknown authors
"... Energy efficiency a n are d (i e fir ing t of By feeding these linear constraints into an integer programming formulation, we then propose a routing orking alizing lly hig ure of withou devices, while preserving flexibility and cost efficiency, is a great challenge not supported by current technolog ..."
Abstract - Add to MetaCart
timely manner. The key contributions of this paper are: We propose a novel way to represent the capacity region of a set of stations sharing the wireless medium, which we refer to as linearized capacity region, and compute the corresponding ⇑ Corresponding author.

Gaussian interference channel capacity to within one bit

by Raul H. Etkin, David N. C. Tse, Hua Wang - 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the two-user 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 452 (28 self) - Add to MetaCart
Abstract—The capacity of the two-user 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

Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

by Murali Kodialam, Thyaga Nandagopal - in ACM MobiCom , 2005
"... Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are characterized by the use of multiple orthogonal channels and nodes with the ability to simultaneously communicate with many nei ..."
Abstract - Cited by 244 (0 self) - Add to MetaCart
network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We provide necessary conditions to verify the feasibility of rate vectors in these networks, and use them to derive upper bounds on the capacity in terms of achievable throughput

On the capacity region of the semideterministic Z channel

by Wuling Liu, Nan Liu, Zhiwen Pan - In Proceedings of the International Conference on Wireless Communications and Signal Processing , 2011
"... Abstract—We study a class of discrete memoryless Z channels, where there are some deterministic components in the channel configuration. We call this channel the semi-deterministic Z channel. We first provide an outer bound on the capacity region. Then the known achievable rate region for the genera ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract—We study a class of discrete memoryless Z channels, where there are some deterministic components in the channel configuration. We call this channel the semi-deterministic Z channel. We first provide an outer bound on the capacity region. Then the known achievable rate region

Capacity Region of Gaussian MIMO Broadcast

by Channels Common, Confidential Messages, Ersen Ekrem, Sennur Ulukus , 2010
"... We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common message to both users, and a confidential message to each user which needs to be kept perfectly secret from the other user. We ..."
Abstract - Add to MetaCart
. We obtain the entire capacity region of this channel. We also explore the connections between the capacity region we obtain for the Gaussian MIMO broadcast channel with common and confidential messages and the capacity region of its non-confidential counterpart, i.e., the Gaussian MIMO broadcast
Next 10 →
Results 1 - 10 of 9,089
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University