Sciweavers

171 search results - page 8 / 35
» RA Codes Achieve AWGN Channel Capacity
Sort
View
ICC
2007
IEEE
186views Communications» more  ICC 2007»
13 years 9 months ago
On Channel Coding Selection in Time-Slotted ALOHA Packetized Multiple-Access Systems Over Rayleigh Fading Channels
— In this paper, we consider the time-slotted ALOHA packetized multiple-access system where the transmission channels obey i.i.d (independent identically distributed) Rayleigh fa...
Chen Wei, Pingyi Fan, Khaled Ben Letaief
ICC
2009
IEEE
124views Communications» more  ICC 2009»
14 years 2 months ago
Power Optimal Signaling for Fading Multi-Access Channel in Presence of Coding Gap
—In a multi-access fading channel, dynamic allocation of bandwidth, transmission power and rates is an important aspect to counter the detrimental effect of time-varying nature o...
Ankit Sethi, Prasanna Chaporkar, Abhay Karandikar
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar
CISS
2008
IEEE
13 years 9 months ago
Network coding on line networks with broadcast
An achievable rate region for line networks with edge and node capacity constraints and broadcasting is derived. The region is the capacity region if the broadcast channels are ort...
Gerhard Kramer, S. M. Sadegh Tabatabaei Yazdi, Ser...
ICC
2008
IEEE
14 years 1 months ago
Unveiling Near-Capacity Code Design: The Realization of Shannon's Communication Theory for MIMO Channels
— In this contribution we show how Shannon’s coding theory could be realized for Multiple-Input Multiple-Output (MIMO) channels with the aid of EXtrinsic Information Transfer (...
Soon Xin Ng, Jin Wang, Lajos Hanzo