Publication

Dynamic Dual-Window Decoding for SC-LDPC Codes with Wave Enhancement

2026

Abstract

Windowed decoding (WD) based on the belief propagation (BP) algorithm, which slides along a code chain with fixed computational resources, is an efficient decoding scheme for spatially-coupled low-density parity-check (SC-LDPC) codes, particularly for long-length codes. However, due to the lack of decoding waves, WD suffers from a performance degradation compared to full BP decoding. In this paper, we propose a novel decoding schedule for WD, termed dual-WD, which enhances the decoding waves by dynamically merging and splitting two decoding windows that slide in opposite directions. Moreover, a sliding-step selection method based on partial syndrome checks is introduced to reduce decoding complexity. Simulation results demonstrate that the proposed dual-WD outperforms the conventional WD schemes under identical computational complexity constraints, thereby narrowing the performance gap between WD and full BP decoding.

Official source

https://infoscience.epfl.ch/entities/publication/7704e8d5-4673-4979-a42b-60763c0edf59

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.

2026

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/7704e8d5-4673-4979-a42b-60763c0edf59

About this result

Related concepts (32)

Decoding methods

In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of mapping messages to codewords. These are often used to recover messages sent over a noisy channel, such as a binary symmetric channel. is considered a binary code with the length ; shall be elements of ; and is the distance between those elements. One may be given the message , then ideal observer decoding generates the codeword .

Variable-length code

In coding theory, a variable-length code is a code which maps source symbols to a variable number of bits. The equivalent concept in computer science is bit string. Variable-length codes can allow sources to be compressed and decompressed with zero error (lossless data compression) and still be read back symbol by symbol. With the right coding strategy an independent and identically-distributed source may be compressed almost arbitrarily close to its entropy.

Convolutional code

In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial function to a data stream. The sliding application represents the 'convolution' of the encoder over the data, which gives rise to the term 'convolutional coding'. The sliding nature of the convolutional codes facilitates trellis decoding using a time-invariant trellis. Time invariant trellis decoding allows convolutional codes to be maximum-likelihood soft-decision decoded with reasonable complexity.

Related publications (16)

Dynamic Dual-Window Decoding for SC-LDPC Codes with Wave Enhancement

Chat with Graph Search

A Full-Custom Time-Domain Unary Sorter for Soft-Information Decoding in 65 nm CMOS

Enabling Reliable and Scalable LoRa with Collision Resolution and Centralized Radio Access

Complexity of Sampling and Communication