Publication

RAYLEIGH FADING MULTIPLE ACCESS CHANNEL WITHOUT CHANNEL STATE INFORMATION

Publications associées (117)

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

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

Ieee2012

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian

N

-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...

2012

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

Channel State Feedback Over the MIMO-MAC

Krishna Kumar

In order to exploit the full multiplexing gain of multi-antenna multi-user downlink schemes, accurate channel state information at the transmitter (i.e., at the base station) is required. We consider the design of a closed-loop channel state information fe ...

2011

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

A bio-inspired fast swarming algorithm for dynamic radio access

Ali H. Sayed

The goal of this paper is to propose a bio-inspired algorithm for decentralized dynamic access in cognitive radio systems. We study an improved social foraging swarm model that lets every node allocate its resources (power/bits) in the frequency regions wh ...

IEEE2011

Does Fast Adaptive Modulation Always Outperform Slow Adaptive Modulation?

Laura Toni

Link adaptation techniques are important modern and future wireless communication systems to cope with quality of service fluctuations in fading channels. These techniques require the knowledge of the channel state obtained with a portion of resources devo ...

Institute of Electrical and Electronics Engineers2011

Approximate Capacity of a Class of Gaussian Interference-Relay Networks

Christina Fragouli, Suhas Diggavi

In this paper, we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows between different source-destination pairs. We focus on two-stage relay-interference networks where there are weak cr ...

Institute of Electrical and Electronics Engineers2011

Strategies for Delay-Limited Source-Channel Coding

Marius Kleiner

In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon's separation theorem. However, this is in general only true ...

EPFL2010

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian

N

-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...

2012