Publications associées à Méthode de décodage

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen, Yifei Shen, Yuqing Ren, Chuan Zhang

Due to its high parallelism, belief propagation (BP)decoding is amenable to high-throughput applications and thusrepresents a promising solution for the ultra-high peak datarate required by future communication systems. To bridge theperformance gap compare ...

Ieee-Inst Electrical Electronics Engineers Inc2024

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Yuqing Ren, Hassan Harb

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

Ieee-Inst Electrical Electronics Engineers Inc2024

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Rüdiger Urbanke, Kirill Ivanov

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

Marco Bondaschi

We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless channels for ordinary and list-decoding schemes, in particular Berlekamp and Blinovsky's zero-rate bound, as well as Blahut's bound for low rates. The available ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

List Ordered Statistics Decoders for Polar Codes

Andreas Peter Burg, Yifei Shen, Chuan Zhang

The de-facto standard decoding algorithm for polar codes, successive cancellation list (SCL) decoding, is a breadth-first search algorithm. By keeping a list of candidate codewords, SCL decoding improves the performance as the list size L increases. Howeve ...

IEEE2022

Systems and methods for digital information decoding and data storage in hybrid macromolecules

Aleksandra Radenovic, Matteo Dal Peraro, Chan Cao, Lucien Fabrice Krapp

Systems and methods for data storage and readout using hybrid nucleic acid- polymeric molecules are herein disclosed. A molecular data storage medium is presented comprising a header and a footer, each comprising or consisting of at least one unit of a fir ...

2022

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...

2022

Fast Sequence Repetition Node-Based Successive Cancellation List Decoding for Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen, Yifei Shen, Yuqing Ren, Chuan Zhang

Compared with the bit-wise successive cancellation list (SCL) decoding of polar codes, the node-based Fast SCL decoding significantly reduces the decoding latency by identifying special constituent codes and decoding these in parallel. To further reduce th ...

IEEE2022

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.

Méthode de décodage

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

On the Efficiency of Polar-Like Decoding for Symmetric Codes

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

Symmetry in design and decoding of polar-like codes

List Ordered Statistics Decoders for Polar Codes

Systems and methods for digital information decoding and data storage in hybrid macromolecules

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

Fast Sequence Repetition Node-Based Successive Cancellation List Decoding for Polar Codes

Graph Chatbot

Chattez avec Graph Search

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Symmetry in design and decoding of polar-like codes

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Systems and methods for digital information decoding and data storage in hybrid macromolecules

Fast Sequence Repetition Node-Based Successive Cancellation List Decoding for Polar Codes

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

List Ordered Statistics Decoders for Polar Codes

On the Efficiency of Polar-Like Decoding for Symmetric Codes