English
Related papers

Related papers: Polar Coded Modulation via Hybrid Bit Labeling

200 papers

Due to their capacity-achieving property, polar codes have become one of the most attractive channel codes. To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding…

Information Theory · Computer Science 2016-11-18 Bo Yuan , Keshab K. Parhi

The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially-concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the…

Information Theory · Computer Science 2016-11-17 Alberto Perotti , Alberto Tarable , Sergio Benedetto , Guido Montorsi

Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such as in Internet-of-Things (IoT) networks. In this paper, we…

Information Theory · Computer Science 2022-03-24 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

Delayed bit-interleaved coded modulation (DBICM) generalizes bit-interleaved coded modulation (BICM) by modulating differently delayed sub-blocks of codewords onto the same signals. DBICM improves transmission reliability over BICM due to…

Information Theory · Computer Science 2021-08-17 Yihuan Liao , Min Qiu , Jinhong Yuan

Polar codes have attracted the attention of numerous researchers in the past decade due to their excellent performance. However, their performance at short block lengths under standard successive cancellation decoding is far from desirable.…

Information Theory · Computer Science 2023-07-13 Wei Zhang

Benefiting from performance advantages under short code lengths, polar codes are well-suited for certain scenarios, such as the future Internet of Things (IoT) applications that require high reliability and low power. Existing list flip…

Information Theory · Computer Science 2025-04-01 Yansong Lv , Jingxin Dai , Yuhuan Wang , Hang Yin , Zhanxin Yang

Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity…

Information Theory · Computer Science 2023-12-25 Andreas Zunker , Marvin Geiselhart , Lucas Johannsen , Claus Kestel , Stephan ten Brink , Timo Vogt , Norbert Wehn

This paper investigates the bit-interleaved coded generalized spatial modulation (BICGSM) with iterative decoding (BICGSM-ID) for multiple-input multiple-output (MIMO) visible light communications (VLC). In the BICGSM-ID scheme, the…

Information Theory · Computer Science 2022-10-31 Lin Dai , Yi Fang , Yong Liang Guan , Mohsen Guizani

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore,…

Information Theory · Computer Science 2018-08-03 Peihong Yuan , Tobias Prinz , Georg Böcherer , Onurcan İşcan , Ronald Böhnke , Wen Xu

With the evolution from 5G to 6G, ultra-reliable low-latency communication (URLLC) faces increasingly stringent performance requirements. Lower latency constraints demand shorter channel coding lengths, which can severely degrade decoding…

Information Theory · Computer Science 2025-08-07 Yaqi Li , Xiaohu You , Jiamin Li , Chen Ji , Bin Sheng

In this paper, we propose a new class of nonbinary polar codes with two-stage polarization for ultra-reliable and low-latency communications (URLLC), where the outer (symbol-level) polarization is achieved by using a 2X2 q-ary matrix [1 0;…

Information Theory · Computer Science 2019-02-26 Peiyao Chen , Baoming Bai , Xiao Ma

We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) bound of polar codes for sufficiently large…

Information Theory · Computer Science 2018-08-24 Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they…

BMERA or convolutional polar codes are an extension of polar codes with a provably better error exponent than polar codes. A successive cancellation (SC) decoding algorithm for BMERA codes similar to SC polar decoders is introduced. A…

Information Theory · Computer Science 2018-07-11 Tobias Prinz , Peihong Yuan

Polar codes are the first codes with a proven capacity-achieving capability, but their decoding faces several challenges, especially under long code lengths. In this paper, we target algorithmic improvements and analyses to enable the…

Information Theory · Computer Science 2026-05-22 Jiajie Li , Sihui Shen , Warren J. Gross

Although the successive cancelation (SC) algorithm works well for very long polar codes, its error performance for shorter polar codes is much worse. Several SC based list decoding algorithms have been proposed to improve the error…

Information Theory · Computer Science 2015-06-22 Jun Lin , Zhiyuan Yan

A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the…

Information Theory · Computer Science 2013-02-01 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

Spatial coupling is utilized to improve the performance of iterative channel estimation, multiuser detection, and decoding for multiple-input multiple-input (MIMO) bit-interleaved coded modulation (BICM). Coupling is applied to both coding…

Information Theory · Computer Science 2014-12-22 Keigo Takeuchi

A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints…

Information Theory · Computer Science 2021-02-23 Peihong Yuan , Mustafa Cemil Coşkun , Gerhard Kramer

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