English
Related papers

Related papers: A Complexity Reduction Method for Successive Cance…

200 papers

Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Marco Mondelli , S. Hamed Hassani , Rudiger Urbanke , Warren J. Gross

A deep-learning-aided successive-cancellation list (DL-SCL) decoding algorithm for polar codes is introduced with deep-learning-aided successive-cancellation (DL-SC) decoding being a specific case of it. The DL-SCL decoder works by allowing…

Information Theory · Computer Science 2019-12-04 Seyyed Ali Hashemi , Nghia Doan , Thibaud Tonnellier , Warren J. Gross

In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar codes with CRC. This adaptive SC-List decoder iteratively increases the list size until the decoder outputs contain at least one survival path which…

Information Theory · Computer Science 2012-08-16 Bin Li , Hui Shen , David Tse

A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC)…

Information Theory · Computer Science 2021-12-02 Seyyed Ali Hashemi , Marco Mondelli , John Cioffi , Andrea Goldsmith

Successive cancellation (SC) is the first and widely known decoder of polar codes, which has received a lot of attentions recently. However, its decoding schedule generating algorithms are still primitive, which are not only complex but…

Information Theory · Computer Science 2015-05-15 Dan Le , Xiamu Niu

This paper presents a hardware architecture of fast simplified successive cancellation (fast-SSC) algorithm for polar codes, which significantly reduces the decoding latency and dramatically increases the throughput. Algorithmically,…

Information Theory · Computer Science 2015-09-30 Tiben Che , Jingwei Xu , Gwan Choi

Monotone chain polar codes generalize classical polar codes to multivariate settings, offering a flexible approach for achieving the entire admissible rate region in the distributed lossless coding problem. However, this flexibility also…

Information Theory · Computer Science 2025-09-04 Zichang Ren , Chunhang Zheng , Dou Li , Yuping Zhao

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

We propose use of QR factorization with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort…

Information Theory · Computer Science 2007-07-16 Takayuki Fukatani , Ryutaroh Matsumoto , Tomohoko Uyematsu

A tree search algorithm called successive cancellation ordered search (SCOS) is proposed for $\boldsymbol{G}_N$-coset codes that implements maximum-likelihood (ML) decoding with adaptive complexity for transmission over binary-input AWGN…

Information Theory · Computer Science 2024-02-07 Peihong Yuan , Mustafa Cemil Coşkun

A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permutations (SP) of the codeword is presented. A low-complexity SP scheme applied to a subset of the symmetry group of RM codes is first…

Information Theory · Computer Science 2022-09-22 Nghia Doan , Seyyed Ali Hashemi , Marco Mondelli , Warren J. Gross

An efficient implementation of min-sum SC/list decoding of convolutional polar codes is proposed. The complexity of the proposed implementation of SC decoding is more than two times smaller than the straightforward implementation. Moreover,…

Information Theory · Computer Science 2020-07-14 Ruslan Morozov

In this paper, we first indicate that the block error event of polar codes under successive cancellation list (SCL) decoding is composed of path loss (PL) error event and path selection (PS) error event, where the PL error event is that…

Information Theory · Computer Science 2023-07-07 Jinnan Piao , Dong Li , Xueting Yu , Zhibo Li , Ming Yang , Jindi Liu , Peng Zeng

Due to the sequential nature of the successive-cancellation (SC) algorithm, the decoding of polar codes suffers from significant decoding latencies. Fast SC decoding is able to speed up the SC decoding process, by implementing parallel…

Information Theory · Computer Science 2022-11-21 Yang Lu , Ming-Min Zhao , Ming Lei , Min-Jian Zhao

The interest in polar codes has been increasing significantly since their adoption for use in the 5$^{\rm th}$ generation wireless systems standard. Successive cancellation (SC) decoding algorithm has low implementation complexity, but…

Information Theory · Computer Science 2018-09-28 Furkan Ercan , Carlo Condo , Warren J. Gross

The discovery of suitable automorphisms of polar codes gained a lot of attention by applying them in Automorphism Ensemble Decoding (AED) to improve the error-correction performance, especially for short block lengths. This paper introduces…

Information Theory · Computer Science 2023-06-29 Lucas Johannsen , Claus Kestel , Marvin Geiselhart , Timo Vogt , Stephan ten Brink , Norbert Wehn

Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…

Signal Processing · Electrical Eng. & Systems 2026-01-23 Yanfeng Zhang , Xi'an Fan , Xu Zhu , Jinkai Zheng , Hui Liang , Weiwei Yang , Tom H. Luan

Applications of massive machine-type communications, such as sensor networks, smart metering, 'internet-of-things', or process and factory automation, are forecast to have great economic impact in the next five to ten years. Low-complexity…

Information Theory · Computer Science 2019-02-28 Joachim Neu

This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency…

Information Theory · Computer Science 2020-09-08 Marco Mondelli , Seyyed Ali Hashemi , John Cioffi , Andrea Goldsmith

A reduced complexity sequential decoding algorithm for polar (sub)codes is described. The proposed approach relies on a decomposition of the polar (sub)code being decoded into a number of outer codes, and on-demand construction of codewords…

Information Theory · Computer Science 2020-07-08 Grigorii Trofimiuk , Nikolay Iakuba , Stanislav Rets , Kirill Ivanov , Peter Trifonov
‹ Prev 1 3 4 5 6 7 10 Next ›