English
Related papers

Related papers: Finite Alphabet Fast List Decoders for Polar Codes

200 papers

We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after…

Information Theory · Computer Science 2020-07-24 Ying Wang , Minghai Qin , Krishna R. Narayanan , Anxiao Jiang , Zvonimir Bandic

New algorithms for efficient decoding of polar codes (which may be CRC-augmented), transmitted over either a binary erasure channel (BEC) or an additive white Gaussian noise channel (AWGNC), are presented. We start by presenting a new…

Information Theory · Computer Science 2021-07-14 Yonatan Urman , Guy Mogilevsky , David Burshtein

Polar codes under cyclic redundancy check aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes when code lengths are configured to be several kilobits. In order to reduce the decoding…

Information Theory · Computer Science 2015-08-11 Kai Chen , Bin Li , Hui Shen , Jie Jin , David Tse

Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date…

Information Theory · Computer Science 2014-11-27 Bo Yuan , Keshab K. Parhi

Successive cancellation list (SCL) decoding enables polar codes and their generalizations to deliver satisfactory performance in finite-length scenarios but it comes with high latency and complexity. To reduce latency, a partitioned SCL…

Information Theory · Computer Science 2024-11-26 Xinyuanmeng Yao , Xiao Ma

Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either…

Information Theory · Computer Science 2015-11-17 Erdal Arıkan

Polar codes, introduced recently by Ar\i kan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation,…

Information Theory · Computer Science 2009-05-22 Nadine Hussami , Satish Babu Korada , Rudiger Urbanke

This paper proposes a generalization of the recently introduced Successive Cancellation Flip (SCFlip) decoding of polar codes, characterized by a number of extra decoding attempts, where one or several positions are flipped from the…

Information Theory · Computer Science 2017-03-14 Ludovic Chandesris , Valentin Savin , David Declercq

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 successive cancellation (SC) polar decoding, an incorrect estimate of any prior unfrozen bit may bring about severe error propagation in the following decoding, thus it is desirable to find out and correct an error as early as possible.…

Information Theory · Computer Science 2017-12-12 Zhaoyang Zhang , Kangjian Qin , Liang Zhang , Huazi Zhang , Guo Tai Chen

The long-haul communication systems can offer ultra high-speed data transfer rates but suffer from burst errors. The high-rate and high-performance staircase codes provide an efficient way for long-haul transmission. The staircase coding…

Information Theory · Computer Science 2018-05-28 Bowen Feng , Jian Jiao , Liu Zhou , Shaohua Wu , Bin Cao , Qinyu Zhang

Polar codes are a class of error-correcting codes that provably achieve the capacity of practical channels under the low-complexity successive-cancellation flip (SCF) decoding algorithm. However, the SCF decoding algorithm has a variable…

Information Theory · Computer Science 2024-09-06 Ilshat Sagitov , Charles Pillet , Pascal Giard

In this paper, we present a novel decoding algorithm of a polar code, named SC-Fano decoding, by appropriately incorporating the Fano sequential decoding into the standard successive-cancellation (SC) decoding. The proposed SC-Fano decoding…

Signal Processing · Electrical Eng. & Systems 2019-01-24 Min-Oh Jeong , Song-Nam Hong

The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits. Thus, neural network decoding (NND) is currently only feasible for very short…

Information Theory · Computer Science 2017-02-23 Sebastian Cammerer , Tobias Gruber , Jakob Hoydis , Stephan ten Brink

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

For polar codes, successive cancellation list (SCL) decoding algorithm significantly improves finite-length performance compared to SC decoding. SCL-flip decoding can further enhance the performance but the gain diminishes as code length…

Information Theory · Computer Science 2024-07-08 Xianbin Wang , Huazi Zhang , Jiajie Tong , Jun Wang , Wen Tong

This paper proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity. In addition, a logarithmic likelihood ratio (LLR)-threshold based path extension scheme is designed to…

Information Theory · Computer Science 2019-12-18 Haotian Zheng , Bin Chen , Luis F. Abanto-Leon , Zizheng Cao , Ton Koonen

Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only…

Information Theory · Computer Science 2023-01-26 Hossein Rezaei , Nandana Rajatheva , Matti Latva-aho

In this letter we present a new architecture for a polar decoder using a reduced complexity successive cancellation decoding algorithm. This novel fully-unrolled, deeply-pipelined architecture is capable of achieving a coded throughput of…

Hardware Architecture · Computer Science 2015-05-20 Pascal Giard , Gabi Sarkis , Claude Thibeault , Warren J. Gross

We propose a low complexity list successive cancellation (LCLSC) decoding algorithm to reduce complexity of traditional list successive cancellation (LSC) decoding of polar codes while trying to maintain the LSC decoding performance at the…

Information Theory · Computer Science 2013-09-13 Congzhe Cao , Zesong Fei , Jinhong Yuan , Jingming Kuang
‹ Prev 1 4 5 6 7 8 10 Next ›