Sciweavers

1031 search results - page 132 / 207
» The single-serving channel capacity
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 28 days ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ESORICS
2007
Springer
16 years 16 days ago
Cloak: A Ten-Fold Way for Reliable Covert Communications
A number of network covert channels have been proposed recently that may have important ramifications for Internet security and privacy. However, they could become ineffective in...
Xiapu Luo, Edmond W. W. Chan, Rocky K. C. Chang
TIT
2010
115views Education» more  TIT 2010»
15 years 1 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 6 months ago
Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO Systems
— Diversity–multiplexing tradeoff (DMT) presents a compact framework to compare various MIMO systems and channels in terms of the two main advantages they provide (i.e. high da...
Sergey Loyka, George Levin
CDC
2008
IEEE
126views Control Systems» more  CDC 2008»
16 years 25 days ago
Conditions for tracking in networked control systems
— In this paper we obtain information theoretical conditions for tracking in linear time-invariant control systems. We consider the particular case where the closed loop contains...
Ivan Lopez Hurtado, Chaouki T. Abdallah, Sudharman...