Publication

Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders

Publications associées (143)

The Stability Condition of LDPC Codes Under MAP Decoding

We determine the stability condition of low-density parity-check codes under both bitwise and blockwise maximum a posteriori decoding. As a consequence, we prove that the stability condition determines an upper bound on both the bitwise and the blockwise m ...

IEEE2018

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

Alexios Konstantinos Balatsoukas Stimming

In this letter, we describe an LDPC code design framework for the unequal power two-user Gaussian multiple access channel using EXIT charts. We show that the sumrate of the LDPC codes designed using our approach can get close to the maximal sum-rate of the ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Fast-SSC-Flip Decoding of Polar Codes

Andreas Peter Burg, Pascal Giard

Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes. Howe ...

2018

Fast Low-Complexity Decoders for Low-Rate Polar Codes

Alexios Konstantinos Balatsoukas Stimming, Pascal Giard

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommoda ...

2018

On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pascal Giard

Polar codes are a recent family of error-correcting codes with a number of desirable characteristics. Their disruptive nature is illustrated by their rapid adoption in the 5 th-generation mobile-communication standard, where they are used to protect contro ...

IEEE2018

Hybrid Coding Scheme for Brillouin Optical Time-domain Analysis Based on Golay and Differential Pulses

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Zonglei Li

A hybrid Golay coding method based on differential pulse-pair sequences is proposed for distributed Brillouin sensing. The method provides 1.5 dB signal-to-noise ratio improvement over unipolar Golay with halved measurement time, securing high spatial reso ...

Optical Society of America2018

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pascal Giard

Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been ...

Ieee2017

PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Thomas Christoph Müller, Andrea Bonetti, Pascal Giard

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an explici ...

2017

High-Speed Wireline Link Design

Hazar Yüksel

High-speed serial links are a crucial application of semiconductor technology and have been the enabler of the scaling of computing systems. The increasing data-rate requirements of these links have only been partially satisfied by advancements in process ...

EPFL2017

Analysis of Spatially Coupled Systems using the Potential Functional with Applications to Coding Theory

Rafah El-Khatib

For the past 70 years or so, coding theorists have been aiming at designing transmission schemes with efficient encoding and decoding algorithms that achieve the capacity of various noisy channels. It was not until the '90s that graph-based codes, such as ...

EPFL2016

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