Person

Michael Christoph Gastpar

Related publications (232)

Graph Chatbot

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.

Computation over Gaussian multiple-access channels

Michael Christoph Gastpar

We consider the problem of computing the sum of independent Gaussian sources over a Gaussian multiple-access channel (MAC) with respect to a mean-squared error criterion. When the source and channel bandwidths are equal, the best separation-based solution ...

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

Rateless coding with partial CSI at the decoder

Michael Christoph Gastpar

A channel model for channels with unknown state and partial state information available causally at the decoder is proposed. The model is based on arbitrarily varying channels (AVCs), and the partial state information is characterized by allowing the decod ...

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

Spatial feltering in sensor networks with computation codes

Michael Christoph Gastpar

A data collection problem in sensor networks is formulated in which the number of channel uses per source sample is greater than one. An example of this problem is given in which the objective of the data collector is to compute a filtered and downsampled ...

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

The scaling of the broadcast capacity of extended wireless networks with cooperative relays

Michael Christoph Gastpar

We study the scaling of the broadcast capacity for a network with a single source and f(N) cooperative relays where N is the number of destinations and f(.) is an increasing function. We consider random extended networks (the network area goes to infinity ...

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

Computation over Multiple-access Channels

Michael Christoph Gastpar

The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that there is no source-channel separation theorem even when the individual sources are independent. Joint source-channel strategie ...

Institute of Electrical and Electronics Engineers2007

On Capacity Under Receive and Spatial Spectrum-Sharing Constraints

Michael Christoph Gastpar

Capacity is often studied under constraints on the channel input signals. This paper investigates the behavior of capacity when constraints are placed on the channel output signal (as well as generalizations thereof). While such a change in perspective lea ...

Institute of Electrical and Electronics Engineers2007

Randomization bounds on Gaussian arbitrarily varying channels

Michael Christoph Gastpar

The random coding capacity of the Gaussian arbitrarily varying channel (GAVC) under a maximal probability of error criterion is equal to that of an additive white Gaussian noise (AWGN) channel with the interference power as additional noise. The determinis ...

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

Achievable error exponents in multiterminal source coding

Michael Christoph Gastpar

Encoding correlated sources at separate encoders has been studied extensively from the perspective of asymptotically long block codes. The associated error exponents are known for the case of lossless source coding. In this paper, we introduce a novel tech ...

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

On the significance of binning in a scaling-law sense

Michael Christoph Gastpar

An efficient distributed source coding system with two encoders and dependent data streams must remove two kinds of redundancy: redundancy in each stream and between the two streams. The striking result of Slepian and Wolf showed that the latter can be eli ...

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

On cooperation via noisy feedback

Michael Christoph Gastpar

An upper bound is established on the usefulness of noisy feedback for the two-user multiple-access channel (MAC). The bound generalizes a dependence-balance argument developed by Hekstra and Willems for the common-output two-way channel and the MAC with no ...

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