Publications related to Channel capacity

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.

Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks

Michael Christoph Gastpar, Chien-Yi Wang

We consider a fading AWGN 2-user 2-hop network in which the channel coefficients are independently and identically distributed (i.i.d.) drawn from a continuous distribution and vary over time. For a broad class of channel distributions, we characterize the ...

Ieee2012

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

Universal bounds on the scaling behavior of polar codes

Rüdiger Urbanke, Seyed Hamed Hassani, Ali Goli

We consider the problem of determining the tradeoff between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the ...

2012

Joint Reconstruction of Correlated Images from Compressed Images

Pascal Frossard, Vijayaraghavan Thirumalai

This paper proposes a novel joint reconstruction algorithm to decode sets of correlated images from distributively compressed images. We consider a scenario where the images captured at different viewpoints are encoded independently using transform-based c ...

2012

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

Polar Codes for the m-User MAC

Emre Telatar, Emmanuel Abbé

In this paper, polar codes for the m-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Arıkan’s polarization technique applied individually to each user transforms independent uses of a m-user binary input MAC into suc ...

Institute of Electrical and Electronics Engineers2012

Polar Codes for the m-User Multiple Access Channel

Emre Telatar, Emmanuel Abbé

In this paper, polar codes for the m-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Arikan's polarization technique applied individually to each user transforms independent uses of an m-user binary input MAC into su ...

Institute of Electrical and Electronics Engineers2012

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

Channel capacity

Graph Chatbot

Chat with Graph Search

Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks

Simple schedules for half-duplex networks

Spatially coupled ensembles universally achieve capacity under belief propagation

Multi-path content delivery: Efficiency analysis and optimization algorithms

Universal bounds on the scaling behavior of polar codes

Joint Reconstruction of Correlated Images from Compressed Images

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

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

Polar Codes for the m-User MAC

Polar Codes for the m-User Multiple Access Channel

Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks

Polar Codes for the m-User MAC

Polar Codes for the m-User Multiple Access Channel

Spatially coupled ensembles universally achieve capacity under belief propagation

Simple schedules for half-duplex networks

Universal bounds on the scaling behavior of polar codes

Multi-path content delivery: Efficiency analysis and optimization algorithms

Joint Reconstruction of Correlated Images from Compressed Images

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

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