Sciweavers

59 search results - page 10 / 12
» One-Shot Capacity of Discrete Channels
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
Jian Cao, Edmund M. Yeh
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 8 months ago
Interference Channels with Common Information
In this paper, the interference channel with common information (ICC), in which two senders need deliver not only private messages but also certain common messages to their corresp...
Jinhua Jiang, Yan Xin, Hari Krishna Garg
ICASSP
2009
IEEE
14 years 12 days ago
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
Ziad Naja, Florence Alberge, Pierre Duhamel
ICC
2008
IEEE
160views Communications» more  ICC 2008»
14 years 3 months ago
Performance Analysis of Adaptive M-QAM for Rayleigh Fading Cooperative Systems
— The use of constant-power, rate-adaptive M-QAM transmission with an amplify-and-forward cooperative system is proposed. The upper bound expressions are derived for the outage p...
Tyler Nechiporenko, Khoa T. Phan, Chintha Tellambu...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 8 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav