Rateless codes for the Gaussian multiple access channel

Urs Niesen*, Uri Erez, Devavrat Shah, Gregory W. Wornell

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 achieves a maximum sum rate point on the boundary of the capacity region for this channel for any set of active users S simultaneously, as if S were known at the transmitters. The proposed coding scheme splits each user into a set of virtual users, each of which can be decoded using a single-user decoder at the receiver instead of having to decode all users jointly. We also present a generalization of this scheme to the case where the channel gains differ between users and each user only knows its own channel gain.

Original languageEnglish
Title of host publicationIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
DOIs
StatePublished - 2006
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: 27 Nov 20061 Dec 2006

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Conference

ConferenceIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Country/TerritoryUnited States
CitySan Francisco, CA
Period27/11/061/12/06

Fingerprint

Dive into the research topics of 'Rateless codes for the Gaussian multiple access channel'. Together they form a unique fingerprint.

Cite this