English
Related papers

Related papers: 5G NR CA-Polar Maximum Likelihood Decoding by GRAN…

200 papers

In this work, we present a family of architectures for polar decoders using a reduced-complexity successive-cancellation decoding algorithm that employs unrolling to achieve extremely high throughput values while retaining moderate…

Hardware Architecture · Computer Science 2016-07-12 Pascal Giard , Gabi Sarkis , Claude Thibeault , Warren J. Gross

An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successive demapping are estimated using the LM-rate, an achievable…

Information Theory · Computer Science 2016-10-26 Georg Böcherer , Tobias Prinz , Peihong Yuan , Fabian Steiner

Maximum-likelihood (ML) decoding can be used to obtain the optimal performance of error correction codes. However, the size of the search space and consequently the decoding complexity grows exponentially, making it impractical to be…

Information Theory · Computer Science 2022-05-25 Mohammad Rowshan , Jinhong Yuan

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…

Information Theory · Computer Science 2007-07-13 Igal Sason , Shlomo Shamai

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

Binary linear block codes (BLBCs) are essential to modern communication, but their diverse structures often require tailor-made decoders, increasing complexity. This work introduces enhanced polar decoding ($\mathsf{PD}^+$), a universal…

Information Theory · Computer Science 2025-05-16 Chien-Ying Lin , Yu-Chih Huang , Shin-Lin Shieh , Po-Ning Chen

We establish that during the execution of any Guessing Random Additive Noise Decoding (GRAND) algorithm, an interpretable, useful measure of decoding confidence can be evaluated. This measure takes the form of a log-likelihood ratio (LLR)…

Information Theory · Computer Science 2023-08-11 Ken R. Duffy , Muriel Medard

Massive machine-type communications (mMTC) is one of the key application scenarios for future 5G networks. Non-orthogonal multiple access (NOMA) is a promising technique for the use in mMTC scenario. In this paper, we investigate NOMA…

Information Theory · Computer Science 2019-01-23 Evgeny Marshakov , Gleb Balitskiy , Kirill Andreev , Alexey Frolov

Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an…

Information Theory · Computer Science 2021-07-28 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

In blind detection, a set of candidates has to be decoded within a strict time constraint, to identify which transmissions are directed at the user equipment. Blind detection is an operation required by the 3GPP LTE/LTE-Advanced standard,…

Information Theory · Computer Science 2017-05-17 Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

Bit-interleaved coded modulation (BICM) and multilevel coded modulation (MLC) are commonly used to combine polar codes with high order modulation. While BICM benefits from simple design and the separation of coding and modulation, MLC shows…

Information Theory · Computer Science 2022-02-16 Hanwen Yao , Jinfeng Du , Alexander Vardy

We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the…

Information Theory · Computer Science 2020-10-23 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek , Tähvend Uustalu

Guessing random additive noise decoding (GRAND) is a maximum likelihood (ML) decoding method that identifies the noise effects corrupting code-words of arbitrary code-books. In a joint detection and decoding framework, this work…

Information Theory · Computer Science 2023-04-18 Hadi Sarieddeen , Muriel Médard , Ken. R. Duffy

Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\i}kan's polar encoder and…

Information Theory · Computer Science 2017-03-01 Mostafa El-Khamy , Hessam Mahdavifar , Gennady Feygin , Jungwon Lee , Inyup Kang

In this paper, we focus on the demodulation/decoding of the complex modulations/codes that approach the Shannon capacity. Theoretically, the maximum likelihood (ML) algorithm can achieve the optimal error performance whereas it has…

Information Theory · Computer Science 2022-06-14 Boxiang He , Zitao Wu , Fanggang Wang

To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels…

Information Theory · Computer Science 2023-04-18 Wei An , Muriel Médard , Ken R. Duffy

While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive cancelation (SC) algorithm, the error performance of the SC algorithm is inferior for polar…

Hardware Architecture · Computer Science 2016-11-17 Jun Lin , Chenrong Xiong , Zhiyuan Yan

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…

Information Theory · Computer Science 2012-11-19 Xudong Ma

This paper presents a partially parallel low-density parity-check (LDPC) decoder designed for the 5G New Radio (NR) standard. The design is using a multi-block parallel architecture with a flooding schedule. The decoder can support any code…

Signal Processing · Electrical Eng. & Systems 2021-03-12 Sina Pourjabar , Gwan S. Choi

Polar encoding, described by Arikan in IEEE Transactions on Information Theory, Vol. 55, No. 7, July 2009, was a milestone for telecommunications. A Polar code distributes information among high and low-capacity channels, showing the…

Information Theory · Computer Science 2025-07-29 Geraldo A. Barbosa