Publication

Low Complexity Scheduling and Coding for Wireless Networks

Related publications (178)

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.

On the capacity of erasure relay channel: Multi-relay case

Ramin Khalili

We consider here a single sender-destination multirelay channel. The links connecting the nodes are supposed to be erasure where symbols are received correctly without any error, or lost. We consider that the nodes are not able to use any interference canc ...

2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

2005

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Gaussian Case

Emre Telatar, Suhas Diggavi, Etienne Perron

We consider the problem of compressing a Gaussian source for two decoders, one of which has access to side-information. Kaspi has solved this problem for discrete memoryless sources for the two cases with and without encoder side-information. We focus on t ...

2005

FPGA implementation of Viterbi decoders for MIMO-BICM

Andreas Peter Burg

The FPGA implementation of Viterbi decoders for multiple-input multiple-output (MIMO) wireless communication systems with bit-interleaved coded modulation (BICM) and perantenna coding is considered. The paper describes how the recursive add-compare-select ...

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

Index Assignment for N Balanced Multiple Description Scalar Quantization

Pascal Frossard, Ivana Radulovic

In this paper, we address the design of any number of balanced multiple descriptions using the multiple description scalar quantization(MDSQ) technique. The proposed scheme has the advantages of low complexity, the possibility of being extended easily to a ...

2005

Systematic encoding and decoding of chain reaction codes

Mohammad Amin Shokrollahi

A method of encoding data into a chain reaction code includes generating a set of input symbols from input data. Subsequently, one or more non-systematic output symbols is generated from the set of input symbols, each of the one or more non-systematic outp ...

2005

Concatenated codes for block-fading channels

Albert Guillén i Fàbregas

In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...

EPFL2004

On the joint source and channel coding of atomic image streams

Pascal Frossard

This paper presents an error resilient coding scheme for atomic image bitstreams, as generated by Matching Pursuit encoders. A joint source and channel coding algorithm is proposed, that takes benefit of both the flexibility in the image representation, an ...

IEEE2004

DCC-MAC: A Decentralized MAC Protocol for 802.15.4a-like UWB Mobile Ad-Hoc Networks Based on Dynamic Channel Coding

Jean-Yves Le Boudec, Ruben Merz, Jörg Widmer

We present a joint PHY/MAC architecture (DCC-MAC) for 802.15.4a-like networks based on PPM-UWB. Unlike traditional approaches it fully utilizes the specific nature of UWB to achieve high rates at low protocol complexity. It is the first MAC protocol that a ...

2004

LDPC codes for Gaussian broadcast channels

Peter Allan Berlin, Daniela Tuninetti

We study coding over a class of two-user broadcast channels with additive white Gaussian noise and fading known at the receivers only. Joint decoding of low-density parity-check codes is analyzed. The message update rule at the mapping node linking the use ...

2004