Publication

Exchange of Limits: Why Iterative Decoding Works

Related publications (41)

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.

A Cache-Assisted Scratchpad Memory for Multiple-Bit-Error Correction

Hossein Asadi, Nooshin Sadat Mirzadeh

Scratchpad memory (SPM) is widely used in modern embedded processors to overcome the limitations of cache memory. The high vulnerability of SPM to soft errors, however, limits its usage in safety-critical applications. This paper proposes an efficient faul ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Re-proving Channel Polarization Theorems

Mine Alsan

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Arikan proved that this class of codes, ...

EPFL2015

Heterogeneous Error-Resilient Scheme for Spectral Analysis in Ultra-Low Power Wearable Electrocardiogram Devices

David Atienza Alonso, Giovanni Ansaloni, Georgios Karakonstantis, Pablo Garcia del Valle, Soumya Subhra Basu

Wearable devices performing advanced bio-signal analysis algorithms will foster a revolution in healthcare provision of chronic cardiac diseases. In this context, energy efficiency is of paramount importance, as long-term operations must be performed withi ...

IEEE Press2015

Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently ...

Institute of Electrical and Electronics Engineers2014

The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...

EPFL2013

Polar Codes: Finite Length Implementation, Error Correlations and Multilevel Modulation

Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...

2012

Synthesis of uniform amplitude focused beam arrays

Juan Ramon Mosig, Anja Skrivervik, Benjamin Fuchs

An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...

2012

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given b ...

2011

Institute of Electrical and Electronics Engineers2011

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional low-density parity-check (LDPC) ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing functions of the average degree. Several variations on the basic theme have been proposed ...

2011