English
Related papers

Related papers: Polar Codes for SCMA Systems

200 papers

Spatial complementary code keying modulation (SCCKM) is proposed as a novel block coding modulation scheme. An input binary sequence is modulated based on the different lengths of complementary code keying (CCK) modulation and then spread…

Information Theory · Computer Science 2017-09-19 A. H. Jafari , T. O'Farrell

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…

Information Theory · Computer Science 2017-04-19 Sebastian Cammerer , Laurent Schmalen , Vahid Aref , Stephan ten Brink

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

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

The successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error, approximating the maximum likelihood decoder (MLD) for small list sizes. Here we adapt the SCL to the task of decoding…

Quantum Physics · Physics 2026-05-14 Anqi Gong , Joseph M. Renes

Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where…

Information Theory · Computer Science 2016-07-12 Pascal Giard , Gabi Sarkis , Camille Leroux , Claude Thibeault , Warren J. Gross

Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes.…

Information Theory · Computer Science 2020-12-16 Peter Trifonov

In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density…

Information Theory · Computer Science 2011-07-28 Ali Eslami , Hossein Pishro-Nik

In this paper, we propose a new polar coding scheme with molecular programming, which is capable of highly parallel implementation at a nano-scale without a need of electrical power sources. We designed chemical reaction networks (CRN) to…

Information Theory · Computer Science 2019-03-12 Toshiki Matsumine , Toshiaki Koike-Akino , Ye Wang

Arikan has shown that systematic polar codes (SPC) outperform nonsystematic polar codes (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared to NSPC, the available encoding methods for SPC…

Information Theory · Computer Science 2016-04-28 Guo Tai Chen , Zhaoyang Zhang , Caijun Zhong , Liang Zhang

In this paper, we investigate a coupled polar code architecture that supports both local and global decoding. This local-global construction is motivated by practical applications in data storage and transmission where reduced-latency…

Information Theory · Computer Science 2023-01-09 Ziyuan Zhu , Wei Wu , Paul H. Siegel

To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. For very high-throughput…

Signal Processing · Electrical Eng. & Systems 2026-05-28 Marwan Jalaleddine , Mohamad Ali Jarkas , Jiajie Li , Warren J. Gross

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

A polar coding scheme for fading channels is proposed in this paper. More specifically, the focus is Gaussian fading channel with a BPSK modulation technique, where the equivalent channel could be modeled as a binary symmetric channel with…

Information Theory · Computer Science 2013-04-16 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communication is proposed. Successive cancellation list (SCL)…

Information Theory · Computer Science 2019-04-05 Barak Beilin , David Burshtein

Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…

Information Theory · Computer Science 2018-03-06 Boaz Shuval , Ido Tal

Motivated by the need to communicate short control messages in 5G and beyond, this paper carefully designs codes for cyclic redundancy check (CRC)-aided list decoding of tail-biting convolutional codes (TBCCs) and polar codes. Both codes…

Information Theory · Computer Science 2023-02-16 Jacob King , Hanwen Yao , William Ryan , Richard D. Wesel

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

This paper conceives a novel sparse code multiple access (SCMA) codebook design which is motivated by the strong need for providing ultra-low decoding complexity and good error performance in downlink Internet-of-things (IoT) networks, in…

Information Theory · Computer Science 2022-09-13 Qu Luo , Zilong Liu , Gaojie Chen , Pei Xiao , Yi Ma , Amine Maaref

Sparse code multiple access (SCMA) is an emerging paradigm for efficient enabling of massive connectivity in future machine-type communications (MTC). In this letter, we conceive the uplink transmissions of the low-density parity check…

Information Theory · Computer Science 2022-02-14 Lingyun Chai , Zilong Liu , Pei Xiao , Amine Maaref , Lin Bai