Sciweavers

225 search results - page 37 / 45
» Capacity Bounds for Sticky Channels
Sort
View
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 2 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
TWC
2010
13 years 2 months ago
On the diversity order of non-orthogonal amplify-and-forward over block-fading channels
Abstract--In this paper, we deal with the performance of nonorthogonal Amplify-and-Forward protocols over block-fading channels (BFNAF), where the source retransmits the same data ...
Ioannis Krikidis, John S. Thompson, Steve McLaughl...
CORR
2008
Springer
83views Education» more  CORR 2008»
13 years 7 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
TIT
1998
70views more  TIT 1998»
13 years 7 months ago
The Poisson Multiple-Access Channel
—The Poisson multiple-access channel (MAC) models many-to-one optical communication through an optical fiber or in free space. For this model we compute the capacity region for ...
Amos Lapidoth, Shlomo Shamai
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 1 months ago
Analysis of a General Mixed Strategy for Gaussian Multiple Relay Channels
— In their landmark paper Cover and El Gamal proposed different coding strategies for the relay channel with a single relay supporting a communication pair. These strategies are ...
Peter Rost, Gerhard Fettweis