English
Related papers

Related papers: Polar Codes for SCMA Systems

200 papers

Bit-interleaved coded modulation (BICM) and multilevel coded modulation (MLC) are commonly used to combine polar codes with high order modulation. While BICM benefits from simple design and the separation of coding and modulation, MLC shows…

Information Theory · Computer Science 2022-02-16 Hanwen Yao , Jinfeng Du , Alexander Vardy

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 a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more…

Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to…

Information Theory · Computer Science 2019-07-02 Wenyue Zhou , Qiang Liu , Yifei Shen , Xiaofeng Zhou , Chuan Zhang , Yaohua Xu , Liping Li

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

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems…

Information Theory · Computer Science 2022-04-01 Shufeng Li , Mingyu Cai , Libiao Jin , Yao Sun , Hongda Wu , Ping Wang

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

We consider the joint design of polar coding and higher-order modulation schemes for ever increased spectral efficiency. The close connection between the polar code construction and the multi-level coding approach is described in detail.…

Information Theory · Computer Science 2012-11-30 Mathis Seidl , Andreas Schenk , Clemens Stierstorfer , Johannes B. Huber

Polar codes, as the first provable capacity-achieving error-correcting codes, have received much attention in recent years. However, the decoding performance of polar codes with traditional successive-cancellation (SC) algorithm cannot…

Information Theory · Computer Science 2014-09-23 Bo Yuan , Keshab K. Parhi

Polar-coded multiple-input multiple-output systems are investigated. An advanced receiver implementing joint list decoding of polar codes and QR- and MMSE-based detectors is proposed. The approximate and exact path metrics are derived for…

Information Theory · Computer Science 2025-08-29 Liudmila Karakchieva , Peter Trifonov

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have…

Information Theory · Computer Science 2020-06-25 Carlo Condo , Valerio Bioglio , Ingmar Land

Multilevel coding (MLC) is a coded modulation technique which can achieve excellent performance over a range of communication channels. Polar codes have been shown to be quite compatible with communication systems using MLC, as the rate…

Information Theory · Computer Science 2021-04-21 Muhammad Zaeem Hasan , Nemanja Stefan Perović , Mark F. Flanagan

Polar codes are of great interests because they provably achieve the capacity of both discrete and continuous memoryless channels while having an explicit construction. Most existing decoding algorithms of polar codes are based on bit-wise…

Information Theory · Computer Science 2016-01-20 Chenrong Xiong , Jun Lin , Zhiyuan Yan

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

Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this…

Information Theory · Computer Science 2014-12-18 Orion Afisiadis , Alexios Balatsoukas-Stimming , Andreas Burg

This work presents a high throughput and energy efficient multicore (MC) successive cancellation (SC) decoder architecture for polar codes. SC is a low-complexity decoding algorithm with a set of sequential operations. The sequential…

Hardware Architecture · Computer Science 2021-08-30 Altuğ Süral , Ertuğrul Kolağasıoğlu

As improved versions of successive cancellation (SC) decoding algorithm, successive cancellation list (SCL) decoding and successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. Unified…

Information Theory · Computer Science 2016-11-15 Kai Chen , Kai Niu , Jia-Ru Lin

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

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

A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar…

Information Theory · Computer Science 2013-02-04 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang
‹ Prev 1 2 3 10 Next ›