Publications related to Asymptotic and finite-length optimization of LDPC codes

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.

Hardware Decoders for Polar Codes: An Overview

Andreas Peter Burg, Pascal Giard

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performa ...

Ieee2016

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

2015

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Rüdiger Urbanke

Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially ...

Institute of Electrical and Electronics Engineers2015

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Scaling Exponent of List Decoders with Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Windowed Decoding of Spatially Coupled Codes

Rüdiger Urbanke

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as fo ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Rüdiger Urbanke, Shrinivas Kudekar

We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a priori threshold of the u ...

Institute of Electrical and Electronics Engineers2013

Asymptotic and finite-length optimization of LDPC codes

Graph Chatbot

Chat with Graph Search

Hardware Decoders for Polar Codes: An Overview

Re-proving Channel Polarization Theorems

Asynchronous Decoding of LDPC Codes over BEC

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

LDPC Codes for 2D Arrays

Generalized Codes on Graphs and Applications in Content Distribution

Scaling Exponent of List Decoders with Applications to Polar Codes

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Windowed Decoding of Spatially Coupled Codes

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Generalized Codes on Graphs and Applications in Content Distribution

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Asynchronous Decoding of LDPC Codes over BEC

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

LDPC Codes for 2D Arrays

Windowed Decoding of Spatially Coupled Codes

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Scaling Exponent of List Decoders with Applications to Polar Codes

Hardware Decoders for Polar Codes: An Overview

Re-proving Channel Polarization Theorems