Publication

Feedback Communication and Control Over a Single Channel

Related publications (44)

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.

Effects of ‘Spatialized’ Communication in Tightly Coupled Work

Pierre Dillenbourg, Mauro Cherubini

This technical report describes the advancements on our research on collaborative annotations of maps. Particularly, we are trying to answer the following research question: does making explicit the location references of the elements of a discourse enhanc ...

2006

Securing Vehicular Communications - Assumptions, Requirements, and Principles

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards the deployment of vehicular communication systems, security and privac ...

2006

Language Support for Fast and Reliable Message Based Communication in Singularity OS

James Richard Larus

Message-based communication offers potential benefits of providing stronger specification and cleaner separation between components. Compared with shared-memory interactions, message passing has the potential disadvantages of being more expensive (no direc ...

2006

Networked Slepian-Wolf: Theory, Algorithms and Scaling Laws

Martin Vetterli, Razvan Cristescu

Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weig ...

2005

Feedback communication over unknown channels

Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev erro ...

EPFL2005

Efficient decentralized communications in sensor networks

Razvan Cristescu

This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a sha ...

EPFL2004

A lower bound to the scaling behavior of sensor networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through a noisy observation process. The sensors can communicate back to a data collector over a noisy channel. The key parameters in such a se ...

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

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Using RASTA in task independent TANDEM feature extraction

John David Scott Dines, Guillermo Aradilla

In this work, we investigate the use of RASTA filter in the TANDEM feature extraction method when trained with a task independent data. RASTA filter removes the linear distortion introduced by the communication channel which is demonstrated in a 18% relat ...

IDIAP2004

Using RASTA in task independent TANDEM feature extraction

John David Scott Dines, Guillermo Aradilla

2004