Sciweavers

225 search results - page 17 / 45
» Capacity Bounds for Sticky Channels
Sort
View
VTC
2007
IEEE
14 years 1 months ago
Opportunistic Feedback Protocol for Achieving Sum-Capacity of the MIMO Broadcast Channel
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
Rajiv Agarwal, Chan-Soo Hwang, John M. Cioffi
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 7 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
Approximate Capacity of Gaussian Relay Networks
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 4 months ago
Secret-key Agreement with Channel State Information at the Transmitter
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a disc...
Ashish Khisti, Suhas N. Diggavi, Gregory W. Wornel...
GLOBECOM
2009
IEEE
14 years 2 months ago
The Gaussian Interference Relay Channel with a Potent Relay
—We consider the Gaussian interference channel with an intermediate relay. The relay is assumed to have abundant power and is named potent for that reason. A main reason to consi...
Ye Tian, Aylin Yener