English
Related papers

Related papers: Polar Coded Modulation via Hybrid Bit Labeling

200 papers

Optimal binary labelings, input distributions, and input alphabets are analyzed for the so-called bit-interleaved coded modulation (BICM) capacity, paying special attention to the low signal-to-noise ratio (SNR) regime. For 8-ary pulse…

Information Theory · Computer Science 2011-10-21 Erik Agrell , Alex Alvarado

Constructing efficient low-rate error-correcting codes with low-complexity encoding and decoding have become increasingly important for applications involving ultra-low-power devices such as Internet-of-Things (IoT) networks. To this end,…

Information Theory · Computer Science 2020-11-02 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

In this work, we present a concatenated repetition-polar coding scheme that is aimed at applications requiring highly unbalanced unequal bit-error protection, such as the Beam Interlock System of the Large Hadron Collider at CERN. Even…

Information Theory · Computer Science 2017-12-04 Alexios Balatsoukas-Stimming , Tomasz Podzorny , Jan Uythoven

We provide a comprehensive performance comparison of soft-output and hard-output demodulators in the context of non-iterative multiple-input multiple-output bit-interleaved coded modulation (MIMO-BICM). Coded bit error rate (BER), widely…

Information Theory · Computer Science 2010-12-07 Peter Fertl , Joakim Jalden , Gerald Matz

This paper proposes a high-throughput energy-efficient Successive Cancellation (SC) decoder architecture for polar codes based on combinational logic. The proposed combinational architecture operates at relatively low clock frequencies…

Hardware Architecture · Computer Science 2016-01-12 Onur Dizdar , Erdal Arıkan

Bit-interleaved coded modulation (BICM) transceivers often use equally spaced constellations and a random interleaver. In this paper, we propose a new BICM design, which considers hierarchical (nonequally spaced) constellations, a bit-level…

Information Theory · Computer Science 2013-03-26 Md. Jahangir Hossain , Alex Alvarado , Leszek Szczecinski

Coded modulation (CM) is the combination of forward error correction (FEC) and multilevel constellations. Coherent optical communication systems result in a four-dimensional (4D) signal space, which naturally leads to 4D-CM transceivers. A…

Information Theory · Computer Science 2024-01-25 Alex Alvarado , Erik Agrell

Polar codes have attracted a lot of attention during past few years and have been adopted as a coding scheme for 5G standard. Successive-cancellation list (SCL) decoder provides high level error-correction performance for polar codes, but…

Information Theory · Computer Science 2019-04-25 Liang Ma , Hang Li , Yuejun Wei

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

A polar-coded modulation scheme for deep-space optical communication is proposed. The photon counting Poisson channel with pulse position modulation (PPM) is considered. We use the fact that PPM is particularly well suited to be used with…

Information Theory · Computer Science 2018-12-10 Delcho Donev , Georg Böcherer

Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does…

Information Theory · Computer Science 2013-03-26 Alex Alvarado , Leszek Szczecinski , Erik Agrell

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

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

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

Spatial Modulation (SM) can utilize the index of the transmit antenna (TA) to transmit additional information. In this paper, to improve the performance of SM, a non-uniform constellation (NUC) and pre-scaling coefficients optimization…

Information Theory · Computer Science 2023-10-25 Xinghao Guo , Hanjiang Hong , Yin Xu , Yi-yan Wu , Dazhi He , Wenjun Zhang

Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as…

Information Theory · Computer Science 2012-08-17 Boyu Li , Hong Ju Park , Ender Ayanoglu

The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel…

Information Theory · Computer Science 2016-10-31 Ahmed Abotabl , Aria Nosratinia

Although iterative decoding of polar codes has recently made huge progress based on the idea of permuted factor graphs, it still suffers from a non-negligible performance degradation when compared to state-of-the-art CRC-aided successive…

Information Theory · Computer Science 2020-01-20 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

A present challenge in wireless communications is the assurance of ultra-reliable and low-latency communication (URLLC). While the reliability aspect is well known to be improved by channel coding with long codewords, this usually implies…

Information Theory · Computer Science 2023-03-15 Sahar Allahkaram , Francisco A. Monteiro , Ioannis Chatzigeorgiou

A reduced complexity sequential decoding algorithm for polar (sub)codes is described. The proposed approach relies on a decomposition of the polar (sub)code being decoded into a number of outer codes, and on-demand construction of codewords…

Information Theory · Computer Science 2020-07-08 Grigorii Trofimiuk , Nikolay Iakuba , Stanislav Rets , Kirill Ivanov , Peter Trifonov
‹ Prev 1 4 5 6 7 8 10 Next ›