Publication

On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes

Related publications (33)

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.

Polar codes for channel and source coding

Satish Babu Korada

The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...

EPFL2009

Soft-output sphere decoding: Algorithms and VLSI implementation

Andreas Peter Burg, Christoph Studer

Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be ...

2008

On capacity of line networks

Christina Fragouli, Daniela Tuninetti, Urs Niesen

We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbi- trary complexity, but the intermediate relay nodes are restricted to process only ...

Institute of Electrical and Electronics Engineers2007

Multi-bit error tolerant caches using two-dimensional error coding

Babak Falsafi

In deep sub-micron ICs, growing amounts of ondie memory and scaling effects make embedded memories increasingly vulnerable to reliability and yield problems. As scaling progresses, soft and hard errors in the memory system will increase and single error ev ...

2007

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

Robust Transmission of H.264/AVC Streams Using Adaptive Group Slicing and Unequal Error Protection

Nikolaos Thomos

We present a novel scheme for the transmission of H.264/AVC video streams over lossy packet networks. The proposed scheme exploits the error-resilient features of H.264/AVC codec and employs Reed-Solomon codes to protect effectively the streams. A novel te ...

2006

Joint source-channel coding with feedback

Communications is about conveying information from one point to another subject to certain performance constraints. The information is assumed to be generated by a source and may, for example, represent a voice waveform, the reading of a thermal sensor, or ...

EPFL2005

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q

Mohammad Amin Shokrollahi

Transmission of packets over computer networks is subject to packet-level errors, which appear as "bursts" of bit-level errors and are not well modeled by memoryless binary channels. A standard scrambling technique is used for transmission of packets by th ...

2004

Asymptotic and finite-length analysis of low-density parity-check codes

Changyan Di

This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...

EPFL2004

Low-delay low-complexity error-correcting codes on sparse graphs

Xiao-Yu Hu

This dissertation presents a systematic exposition on finite-block-length coding theory and practice. We begin with the task of identifying the maximum achievable rates over noisy, finite-block-length constrained channels, referred to as (ε, n)-capacity Cε ...

EPFL2003

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

n

and

k

, constru ...

2006