Publication

Efficient Ordered Statistics Decoder with Unfolded Gaussian Elimination

2025

Abstract

Ordered statistics decoding (OSD) is a universal decoding algorithm for short-length linear block codes that approaches maximum likelihood decoding when run at sufficiently high order. However, the high computational complexity and latency of Gaussian elimination make it challenging for OSD implementations to meet stringent latency constraints. In this paper, we design a hardware decoder for OSD with order one, featuring an unfolded Gaussian elimination architecture with configurable parallelism. The proposed architecture can efficiently process multiple matrix columns and guarantees a low decoding latency. Based on 65 nm CMOS technology, the synthesis results show a worst-case throughput of 958 Mbps for a (128, 105) polar code at a frequency of 575 MHz.

Official source

https://infoscience.epfl.ch/entities/publication/4c408c85-1d09-4120-b869-45abacd9ca47

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/4c408c85-1d09-4120-b869-45abacd9ca47

About this result

Related concepts (32)

Block code

In coding theory, block codes are a large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples for block codes, many of which have a wide range of practical applications. The abstract definition of block codes is conceptually useful because it allows coding theorists, mathematicians, and computer scientists to study the limitations of all block codes in a unified way.

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.

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Related publications (17)

Efficient Ordered Statistics Decoder with Unfolded Gaussian Elimination

Chat with Graph Search

Investigation into acceleration schemes for nuclear fuel performance mechanics solvers

Compressed Sensing and Adaptive Graph Total Variation for Tomographic Reconstructions

Polarity-Balanced Codes