Publications related to Computation over multiple-access channels

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Compute-and-Forward using nested linear codes for the Gaussian MAC

Michael Christoph Gastpar, Jingge Zhu

The classical modulo-lattice construction of Erez et al. has been successfully applied to several coding problems under Gaussian noise, including coding for computation over multiple-access channels (MAC). For the latter problem, an alternative constructio ...

2015

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Michael Christoph Gastpar, Jingge Zhu

Lattice codes are applied to the two-user Gaussian multiple access channel (MAC) combined with a modified compute-and-forward transmitting scheme. It is shown that non-corner points on the boundary of the capacity region can be achieved by decoding two int ...

IEEE2014

Polar Codes for the Two-User Multiple-Access Channel

Emre Telatar, Eren Sasoglu

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...

Institute of Electrical and Electronics Engineers2013

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

Simple Relaying Strategies for Half-duplex Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Using simple outer bounds on the capacity of the network, we show that simple relaying strategies having exactly two states and a ...

2012

Polar coding schemes for the AWGN channel

Emmanuel Abbé

This paper investigates polar coding schemes achieving capacity for the AWGN channel. The approaches using a multiple access channel with a large number of binary-input users and a single-user channel with a large prime-cardinality input are compared with ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Polar coding: a brief tour

Emre Telatar

Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless channels. In this talk I will attempt to describe this technique, and briefly discuss its extensions to q-ary input channels, multiple access channels and r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

The Interference-Multiple-Access Channel

Emre Telatar, Suhas Diggavi, Etienne Perron

We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the o ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Computation over multiple-access channels

Graph Chatbot

Chat with Graph Search

Compute-and-Forward using nested linear codes for the Gaussian MAC

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Polar Codes for the Two-User Multiple-Access Channel

Simple schedules for half-duplex networks

Simple Relaying Strategies for Half-duplex Networks

Polar coding schemes for the AWGN channel

Polar Coding Theorems for Discrete Systems

Polar coding: a brief tour

Tight Bounds on the Capacity of Binary Input random CDMA Systems

The Interference-Multiple-Access Channel

Polar Coding Theorems for Discrete Systems

The Interference-Multiple-Access Channel

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Polar coding: a brief tour

Compute-and-Forward using nested linear codes for the Gaussian MAC

Polar Codes for the Two-User Multiple-Access Channel

Polar coding schemes for the AWGN channel

Simple schedules for half-duplex networks

Simple Relaying Strategies for Half-duplex Networks

Tight Bounds on the Capacity of Binary Input random CDMA Systems