Publication

Decoding Product Codes with Belief Propagation

2025

Abstract

Product codes are considered a promising coding scheme for future optical and wireless communications. However, existing soft-input soft-output (SISO) iterative decoding for product codes involves sorting, list management, and soft-output generation, which includes hardware-unfriendly operations and dataflow. In this paper, we apply belief propagation (BP) decoding to product codes, which leverages the sparse factor graphs of the component codes. As an inherently SISO approach, the proposed product BP decoder can directly propagate soft messages across iterations with a hardware-friendly parallel structure, which outperforms the traditional Chase-Pyndiah decoding with a list size of 64 for various code rates.

Official source

https://infoscience.epfl.ch/entities/publication/d49b1238-96c9-43c3-ad89-ddc3552e3411

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

2025

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/d49b1238-96c9-43c3-ad89-ddc3552e3411

About this result

Related concepts (32)

Viterbi decoder

A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using a convolutional code or trellis code. There are other algorithms for decoding a convolutionally encoded stream (for example, the Fano algorithm). The Viterbi algorithm is the most resource-consuming, but it does the maximum likelihood decoding. It is most often used for decoding convolutional codes with constraint lengths k≤3, but values up to k=15 are used in practice. Viterbi decoding was developed by Andrew J.

Low-density parity-check code

In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel. An LDPC code is constructed using a sparse Tanner graph (subclass of the bipartite graph). LDPC codes are , which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical maximum (the Shannon limit) for a symmetric memoryless channel.

Turbo code

In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed around 1990–91, but first published in 1993. They were the first practical codes to closely approach the maximum channel capacity or Shannon limit, a theoretical maximum for the code rate at which reliable communication is still possible given a specific noise level. Turbo codes are used in 3G/4G mobile communications (e.g.

Related publications (6)

Decoding Product Codes with Belief Propagation

Chat with Graph Search

Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs

Non-coherent Network Coding: An Arbitrarily Varying Channel Approach

Not Just for Errors: Codes for Fast and Secure Flash Storage