English
Related papers

Related papers: Flexible IR-HARQ Scheme for Polar-Coded Modulation

200 papers

This paper addresses the issue of efficient turbo packet combining techniques for coded transmission with a Chase-type automatic repeat request (ARQ) protocol operating over a multiple-input--multiple-output (MIMO) channel with intersymbol…

Information Theory · Computer Science 2010-08-05 Tarik Ait-Idir , Samir Saoudi

A polar decomposition of mutual information between a complex-valued channel's input and output is proposed for a input whose amplitude and phase are independent of each other. The mutual information is symmetrically decomposed into three…

Information Theory · Computer Science 2013-04-02 Qiuliang Xie , Zhaocheng Wang , Zhixing Yang

A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which…

Information Theory · Computer Science 2013-07-12 Peter Trifonov , Vera Miloslavskaya

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

For decades, cellular networks have greatly evolved to support high data rates over reliable communication. Hybrid automatic-repeat-request (ARQ) is one of the techniques to make such improvement possible. However, this advancement is…

Information Theory · Computer Science 2012-09-18 Hyukjoon Kwon , Jungwon Lee , Inyup Kang

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

A framework is proposed that allows for a joint description and optimization of both binary polar coding and the multilevel coding (MLC) approach for $2^m$-ary digital pulse-amplitude modulation (PAM). The conceptual equivalence of polar…

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

We propose two schemes for selective-repeat ARQ protocols over packet erasure channels with unreliable feedback: (i) a hybrid ARQ protocol with soft combining at the receiver, and (ii) a coded ARQ protocol, by building on the uncoded…

Information Theory · Computer Science 2018-02-01 Derya Malak , Muriel Médard , Edmund M. Yeh

We consider multiple access with re-transmission diversity (RTxD) based on a hybrid automatic request (HARQ) protocol with incremental redundancy (IR) in this paper. In order to mitigate multiple access interference (MAI), we employ…

Information Theory · Computer Science 2020-10-14 Jinho Choi

A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…

Information Theory · Computer Science 2015-03-25 Noam Presman , Ofer Shapira , Simon Litsyn

An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successive demapping are estimated using the LM-rate, an achievable…

Information Theory · Computer Science 2016-10-26 Georg Böcherer , Tobias Prinz , Peihong Yuan , Fabian Steiner

For short-packet, low-latency communications over random access channels, piloting overhead significantly reduces spectral efficiency. Therefore, pilotless systems recently gained attraction. While blind phase estimation algorithms such as…

Information Theory · Computer Science 2023-05-04 Marvin Geiselhart , Marc Gauger , Felix Krieg , Jannis Clausius , Stephan ten Brink

A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural labeling, where the bit-level corresponding to the sign-bit is generated in dependence on the previous…

Information Theory · Computer Science 2019-10-30 Onurcan İşcan , Ronald Böhnke , Wen Xu

In this work we address the issues of probabilistic modelling of the decoding errors in hybrid ARQ (HARQ) rounds. In particular we i) claim that the assumption of independence of decoding errors, used implicitly in various works on this…

Information Theory · Computer Science 2015-12-09 Redouane Sassioui , Etienne Pierre-Doray , Leszek Szczecinski , Benoit Pelletier

We consider the problem of using polar codes over slow fading wireless channels. For design, we focus on a parallel slow fading channel with 2 blocks, and polar codes with rate <= 1/2. Motivated by Arikan's systematic polar code…

Information Theory · Computer Science 2016-10-18 Saurabha R Tavildar

This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation…

Information Theory · Computer Science 2017-09-22 Tiben Che , Gwan Choi

Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure by transmitting random bits that are encoded as qubits and sent over a quantum channel, followed by classical…

In this work, we develop low complexity, optimal power allocation algorithms that would allow ultra reliable operation at any outage probability target with minimum power consumption in the finite blocklength regime by utilizing…

Information Theory · Computer Science 2020-02-27 Endrit Dosti , Mohammad Shehab , Hirley Alves , Matti Latva-aho

In this paper, polar codes for the $m$-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Ar{\i}kan's polarization technique applied individually to each user transforms independent uses of a $m$-user…

Information Theory · Computer Science 2010-08-10 Emmanuel Abbe , Emre Telatar

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use the Arikan construction, the resulting channels will polarize to one of five possible extremals, on each of…

Information Theory · Computer Science 2016-11-15 Eren Sasoglu , Emre Telatar , Edmund Yeh