Sciweavers

225 search results - page 19 / 45
» Capacity Bounds for Sticky Channels
Sort
View
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 8 months ago
The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and in...
Ender Tekin, Aylin Yener
SPAA
2010
ACM
14 years 1 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
PIMRC
2008
IEEE
14 years 2 months ago
Multiuser diversity in channels with limited scatterers
—Multiuser diversity scheduling is studied in a single cell system with a limited scatterers channel. The scheduler implements the proportional fairness algorithm with infinite ...
Kimmo Kansanen, Ralf R. Müller
TIT
2011
98views more  TIT 2011»
13 years 3 months ago
Information Rates for Multiantenna Systems With Unknown Fading
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
Krishnan Padmanabhan, Sundeep Venkatraman, Oliver ...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
On broadcast channels with binary inputs and symmetric outputs
We study the capacity regions of broadcast channels with binary inputs and symmetric outputs. We study the partial order induced by the more capable ordering of broadcast channels...
Yanlin Geng, Chandra Nair, Shlomo Shamai, Zizhou V...