Publication

Efficient Ordered Statistics Decoder with Unfolded Gaussian Elimination

2025

Résumé

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.

Source officielle

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

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chat

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.

2025

Résumé

Source officielle

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

À propos de ce résultat

Concepts associés (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.

Afficher plus

Publications associées (17)

Afficher plus

Efficient Ordered Statistics Decoder with Unfolded Gaussian Elimination

Chattez avec 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