English
Related papers

Related papers: Balanced Low-Complexity and Flexible Error-Correct…

200 papers

The recently proposed SCLF decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SCL decoding. However, it comes at the cost of a higher complexity. In this paper, partitioned polar codes tailored…

Information Theory · Computer Science 2026-05-12 Charles Pillet , Ilshat Sagitov , Pascal Giard

This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm. We first…

Information Theory · Computer Science 2022-01-25 Nghia Doan , Seyyed Ali Hashemi , Warren J. Gross

Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL)…

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

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

Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern…

Signal Processing · Electrical Eng. & Systems 2018-06-06 Pascal Giard , Andreas Burg

The recently proposed Successive-Cancellation List Flip (SCLF) decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SC List (SCL) decoding. However, it comes at the cost of a higher complexity. In…

Information Theory · Computer Science 2024-09-04 Charles Pillet , Ilshat Sagitov , Grégoire Domer , Pascal Giard

Successive cancellation list decoders with flip operations (SCL-Flip) can utilize re-decoding attempts to significantly improve the error-correction performance of polar codes. However, these re-decoding attempts result in extra computation…

Information Theory · Computer Science 2021-12-10 Yansong Lv , Hang Yin , Zhanxin Yang , Yuhuan Wang , Jingxin Dai , Jing Huan

SC-Flip (SCF) is a low-complexity polar code decoding algorithm with improved performance, and is an alternative to high-complexity (CRC)-aided SC-List (CA-SCL) decoding. However, the performance improvement of SCF is limited since it can…

Information Theory · Computer Science 2020-09-22 Furkan Ercan , Thibaud Tonnellier , Nghia Doan , Warren J. Gross

Polar codes can be decoded with the low-complexity successive-cancellation flip (SCF) algorithm. To improve error-correction performance, the dynamic successive-cancellation flip (DSCF) variant was proposed, where the resulting…

Information Theory · Computer Science 2021-01-13 Ilshat Sagitov , Pascal Giard

Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for $5^{\rm th}$ generation wireless communication standards. Successive-cancellation (SC) decoding of polar…

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

Polar codes have attracted much attention in the past decade due to their capacity-achieving performance. The higher decoding capacity is required for 5G and beyond 5G (B5G). Although the cyclic redundancy check (CRC)- assisted successive…

Signal Processing · Electrical Eng. & Systems 2019-12-12 Chun-Hsiang Chen , Chieh-Fang Teng , An-Yeu Wu

Due to the ability to provide superior error-correction performance, the successive cancellation list (SCL) algorithm is widely regarded as one of the most promising decoding algorithms for polar codes with short-to-moderate code lengths.…

Information Theory · Computer Science 2023-11-15 Yang Lu , Ming-Min Zhao , Ming Lei , Min-Jian Zhao

Successive-cancellation list (SCL) decoding of polar codes has been adopted for 5G. However, the performance is not very satisfactory with moderate code length. Heuristic or deep-learning-aided (DL-aided) flip algorithms have been developed…

Information Theory · Computer Science 2021-06-25 Yaoyu Tao , Zhengya Zhang

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

Polar codes are a class of capacity achieving error correcting codes that has been recently selected for the next generation of wireless communication standards (5G). Polar code decoding algorithms have evolved in various directions,…

Information Theory · Computer Science 2017-10-16 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length,…

Hardware Architecture · Computer Science 2014-11-18 Jun Lin , Zhiyuan Yan

Polar codes are the first error-correcting code proven to achieve channel capacity based on infinite code length. The Successive Cancellation List Flip (SCLF) decoding algorithm was proposed by flipping an erroneous bit during the next…

Signal Processing · Electrical Eng. & Systems 2026-05-25 Fu-Siang Liang , Shan Lu , Yeong-Luh Ueng

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

Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding…

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

Flexibility is one mandatory aspect of channel coding in modern wireless communication systems. Among other things, the channel decoder has to support several code lengths and code rates. This need for flexibility applies to polar codes…

Information Theory · Computer Science 2017-10-24 Mathieu Léonardon , Adrien Cassagne , Camille Leroux , Christophe Jégo , Louis-Philippe Hamelin , Yvon Savaria
‹ Prev 1 2 3 10 Next ›