English
Related papers

Related papers: Successive Cancellation Inactivation Decoding for …

200 papers

Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list…

Information Theory · Computer Science 2020-01-08 Seyyed Ali Hashemi , Carlo Condo , Marco Mondelli , Warren J. Gross

This study focuses on the efficiency of message-passing-based decoding algorithms for polar and low-density parity-check (LDPC) codes. Both successive cancellation (SC) and belief propagation (BP) decoding algorithms are studied {in} the…

Information Theory · Computer Science 2023-04-24 Dawei Yin , Yuan Li , Xianbin Wang , Jiajie Tong , Huazi Zhang , Jun Wang , Guanghui Wang , Jun Chen , Guiying Yan , Zhiming Ma , Wen Tong

In this paper we propose an enhanced soft cancellation (SCAN) decoder for polar codes based on decoding stages permutation. The proposed soft cancellation list (SCANL) decoder runs $L$ independent SCAN decoders, each one relying on a…

Information Theory · Computer Science 2020-01-31 Charles Pillet , Carlo Condo , Valerio Bioglio

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have…

Information Theory · Computer Science 2020-06-25 Carlo Condo , Valerio Bioglio , Ingmar Land

A novel permutation decoding method for Reed-Muller codes is presented. The complexity and the error correction performance of the suggested permutation decoding approach are similar to that of the recursive lists decoder. It is…

Information Theory · Computer Science 2019-10-28 Mikhail Kamenev , Yulia Kameneva , Oleg Kurmaev , Alexey Maevskiy

This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation…

Information Theory · Computer Science 2026-05-15 Xinyuanmeng Yao , Xiao Ma

The maximum information rates for bandlimited channels with direct detection are achieved with joint detection and decoding (JDD), but JDD is often too complex to implement. Two receiver structures are studied to reduce complexity: separate…

Information Theory · Computer Science 2023-12-20 Tobias Prinz , Daniel Plabst , Thomas Wiegart , Stefano Calabrò , Norbert Hanik , Gerhard Kramer

This paper presents a refined analysis of the block error rate (BLER) of polar codes over symmetric binary-input discrete memoryless channels under successive cancellation (SC) and successive cancellation list (SCL) decoding. A novel…

Information Theory · Computer Science 2026-03-23 Hassan Noghrei , Murad Abdullah

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications.…

Information Theory · Computer Science 2016-11-17 Alexios Balatsoukas-Stimming , Georgios Karakonstantis , Andreas Burg

Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to…

Information Theory · Computer Science 2019-07-02 Wenyue Zhou , Qiang Liu , Yifei Shen , Xiaofeng Zhou , Chuan Zhang , Yaohua Xu , Liping Li

In this letter, we propose parallel SC (Successive Cancellation) decoder and parallel SC-List decoder for polar codes. The parallel decoder is composed of M=2^m(m>=1) component decoders working in parallel and each component decoder decodes…

Information Theory · Computer Science 2013-09-05 Bin Li , Hui Shen , David Tse

Automorphism ensemble (AE) decoding for polar codes was proposed by decoding permuted codewords with successive cancellation (SC) decoders in parallel and hence has lower latency compared to that of successive cancellation list (SCL)…

Information Theory · Computer Science 2022-06-24 Zicheng Ye , Yuan Li , Huazi Zhang , Rong Li , Jun Wang , Guiying Yan , Zhiming Ma

Polar codes are the first class of capacity-achieving forward error correction (FEC) codes. They have been selected as one of the coding schemes for the 5G communication systems due to their excellent error correction performance when…

Signal Processing · Electrical Eng. & Systems 2019-05-23 ChenYang Xia , YouZhe Fan , Chi-ying Tsui

In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding…

Information Theory · Computer Science 2026-05-21 Charles Pillet , Pascal Giard , Bassant Selim , François Leduc-Primeau

A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar…

Information Theory · Computer Science 2021-06-29 Yonatan Urman , David Burshtein

We combine two approaches to optimize the iterative decoding of product codes with precoded polar component codes. On one side, we generate bitwise soft messages based on the codebook probability, an approximation of an auxiliary quantity…

Information Theory · Computer Science 2025-08-29 Nicolás Alvarez Prado , Andreas Straßhofer

As the first kind of forward error correction (FEC) codes that achieve channel capacity, polar codes have attracted much research interest recently. Compared with other popular FEC codes, polar codes decoded by list successive cancellation…

Signal Processing · Electrical Eng. & Systems 2018-07-02 ChenYang Xia , Ji Chen , YouZhe Fan , Chi-ying Tsui , Jie Jin , Hui Shen , Bin Li

Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding…

Information Theory · Computer Science 2016-11-17 Jun Lin , Chenrong Xiong , Zhiyuan Yan

In many practical communication systems, one binary encoder/decoder pair is used to communicate over a set of parallel channels. Examples of this setup include multi-carrier transmission, rate-compatible puncturing of turbo-like codes, and…

Information Theory · Computer Science 2024-01-25 Christian Häger , Alexandre Graell i Amat , Alex Alvarado , Fredrik Brännström , Erik Agrell

Successive interference cancellation (SIC) is a physical layer technique that enables the decoders to decode multiple simultaneously transmitted signals. The complicated model of SIC requires careful design of the MAC protocol and accurate…

Networking and Internet Architecture · Computer Science 2015-02-24 Mohsen Mollanoori