Publication

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

Publications associées (40)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Orthogonal multicarrier modulations in satellite uplinks

Stefano Rosati

In this paper, we analyze Orthogonal Frequency-Division Multiple Access and Single-Carrier Frequency Division Multiple Access as alternative physical layer schemes for the up-link of a satellite network. Both orthogonal frequency-division multiple access a ...

Wiley-Blackwell2014

Efficient MIMO transmission of PSK signals with a single-radio reconfigurable antenna

Julien Perruisseau-Carrier, Mohsen Yousefbeiki

Crucial developments to the recently introduced signal-space approach for multiplexing multiple data symbols using a single-radio switched antenna are presented. First, we introduce a general framework for expressing the spatial multiplexing relation of th ...

Institute of Electrical and Electronics Engineers2014

Energy Efficient VLSI Circuits for MIMO-WLAN

Carl Christian Sten Dominic Senning

Mobile communication - anytime, anywhere access to data and communication services - has been continuously increasing since the operation of the first wireless communication link by Guglielmo Marconi. The demand for higher data rates, despite the limited b ...

EPFL2014

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

Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders

I-Hsiang Wang

In this paper, we consider the K-user Gaussian multiple-access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a bou ...

Institute of Electrical and Electronics Engineers2012

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

Coded SC-FDMA for broadband satellite return links

Stefano Rosati

In this paper we deal with Single Carrier Frequency Division Multiple Access (SC-FDMA) as uplink air interface of broadband satellite networks. Interestingly, SC-FDMA enables a significant increase of the spectral efficiency with respect to the state-of-th ...

Ieee Computer Soc2012

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...

2010

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