Concept

Convolutional code

Publications associées (215)

Refresh-Free Dynamic Standard-Cell Based Memories: Application to a QC-LDPC Decoder

Andreas Peter Burg, Pascal Andreas Meinerzhagen, Georgios Karakonstantis, Andrea Bonetti

The area and power consumption of low-density parity check (LDPC) decoders are typically dominated by embedded memories. To alleviate such high memory costs, this paper exploits the fact that all internal memories of a LDPC decoder are frequently updated w ...

2015

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

LLR-based Successive Cancellation List Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We present an LLR-based implementation of the successive cancellation list (SCL) decoder. To this end, we associate each decoding path with a metric which (i) is a monotone function of the path’s likelihood and (ii) can be computed efﬁciently from the chan ...

Ieee2014

EXIT-based Side Information Refinement in Wyner-Ziv Video Coding

Pascal Frossard, Yiqiang Chen

The accuracy of the side information (SI) is critical in the performance of distributed video coding algorithms. The SI is typically built at a decoder based on the reconstructed data and on channel coding parity bits transmitted by the encoder. The optima ...

Institute of Electrical and Electronics Engineers2014

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successiv ...

2014

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Ieee2014

Polarization Improves E-0

Emre Telatar, Mine Alsan

We prove that channel combining and splitting via Arikan's polarization transformation improves Gallager's reliability function E-0 for binary input channels. In this sense, polarization creates E-0. This observation gives yet another justification as to w ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels

Nicolas Macris, Henry Pfister

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold sat ...

Institute of Electrical and Electronics Engineers2014

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

Exploring Variability in Reflood Simulation Results: an Application of Functional Data Analysis

Andreas Pautz, Damar Canggih Wicaksono, Omar Zerkak

In this paper we followed the functional data analysis (FDA) paradigm to summarize the output of computer code simulating a reflood transient. The paradigm stands on the assumption that the data (code output) is generated by a smooth, albeit complex, proce ...

2014

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search