Sciweavers

171 search results - page 18 / 35
» RA Codes Achieve AWGN Channel Capacity
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
On Communication over Unknown Sparse Frequency-Selective Block-Fading Channels
The problem of reliable communication over unknown frequency-selective block-fading channels with sparse impulse responses is considered. In particular, discrete-time impulse respo...
Arun Pachai Kannu, Philip Schniter
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...
GLOBECOM
2006
IEEE
14 years 1 months ago
Rateless Codes for the Gaussian Multiple Access Channel
Abstract— We consider communication over the Gaussian multiple access channel (MAC) with unknown set of active users. The proposed multiple access strategy is distributed and ach...
Urs Niesen, Uri Erez, Devavrat Shah, Gregory W. Wo...
SIGCOMM
2012
ACM
11 years 10 months ago
Spinal codes
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
Jonathan Perry, Peter Iannucci, Kermin Fleming, Ha...
TCOM
2010
107views more  TCOM 2010»
13 years 6 months ago
Near-Capacity Cooperative Space-Time Coding Employing Irregular Design and Successive Relaying
— In this paper, we develop a capacity-approaching Cooperative Space-Time Coding (CSTC) scheme employing irregular design for a twin-relay aided network as an extension of our pr...
Lingkun Kong, Soon Xin Ng, Robert G. Maunder, Lajo...