English
Related papers

Related papers: Polar Lattices: Where Ar{\i}kan Meets Forney

200 papers

Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is…

Information Theory · Computer Science 2016-05-10 Maiara F. Bollauf , Ram Zamir

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

This paper provides a simplified proof for the existence of nested lattice codebooks allowing to achieve the capacity of the additive white Gaussian noise channel, as well as the optimal rate-distortion trade-off for a Gaussian source. The…

Information Theory · Computer Science 2015-08-10 Or Ordentlich , Uri Erez

Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we…

Information Theory · Computer Science 2019-01-23 Valerio Bioglio , Carlo Condo , Ingmar Land

In this article, we propose the construction of polar codes based on piecewise Gaussian approximation (PGA) techniques. The PGA is first optimized and then compared to the Gaussian approximation (GA) construction method, showing performance…

Information Theory · Computer Science 2022-09-16 R. M. Oliveira , R. C. de Lamare

In this work, we investigate the performance of polar codes with the assistance of feedback in communication systems. Although it is well known that feedback does not improve the capacity of memoryless channels, we show that the finite…

Information Theory · Computer Science 2026-04-13 Ling Liu , Qi Cao , Liping Li , Baoming Bai

The polar receiver architecture is a receiver design that captures the envelope and phase information of the signal rather than its in-phase and quadrature components. Several studies have demonstrated the robustness of polar receivers to…

Information Theory · Computer Science 2022-07-22 Neil Irwin Bernardo , Jingge Zhu , Jamie Evans

In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under…

Information Theory · Computer Science 2018-06-26 Antonio Campello , Daniel Dadush , Cong Ling

This paper investigates polar codes for the additive white Gaussian noise (AWGN) channel. The scaling exponent $\mu$ of polar codes for a memoryless channel $q_{Y|X}$ with capacity $I(q_{Y|X})$ characterizes the closest gap between the…

Information Theory · Computer Science 2017-10-11 Silas L. Fong , Vincent Y. F. Tan

This paper revisits polar code design for a binary-input additive white Gaussian noise (BI-AWGN) channel when successive cancellation (SC) decoding is applied at the receiver. We focus on the reciprocal channel approximation (RCA), which is…

Information Theory · Computer Science 2022-04-25 Hideki Ochiai , Kosuke Ikeya , Patrick Mitran

We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…

Information Theory · Computer Science 2013-11-19 Venkatesan Guruswami , Patrick Xia

We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacity-achieving quantum polar encoding can be reduced by the proposed low-complexity…

Quantum Physics · Physics 2013-02-14 Laszlo Gyongyosi , Sandor Imre

Explicit constructions of polar codes and polar lattices for both lossless and lossy Gray-Wyner problems are studied. Polar codes are employed to extract Wyner's common information of doubly symmetric binary source; polar lattices are then…

Information Theory · Computer Science 2016-10-26 Jinwen Shi , Ling Liu , Cong Ling

Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the analysis and construction of polar codes involve the complex iterative-calculation. In…

Information Theory · Computer Science 2019-11-26 Kai Niu , Yan Li , Weiling Wu

Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel…

Information Theory · Computer Science 2019-01-08 Berksan Serbetci , Ali Emre Pusane

This paper addresses the prediction of error floors of low-density parity-check (LDPC) codes with variable nodes of constant degree in the additive white Gaussian noise (AWGN) channel. Specifically, we focus on the performance of the…

Information Theory · Computer Science 2013-06-11 Brian K. Butler , Paul H. Siegel

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

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…

Information Theory · Computer Science 2014-12-16 Mine Alsan

A modification to 5G New Radio (NR) polar code is proposed, which improves the error correction performance with higher order modulation through probabilistic shaping. The presented scheme mainly re-uses existing hardware at the…

Information Theory · Computer Science 2018-08-29 Onurcan İşcan , Wen Xu

Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. This work aims to increase the throughput of polar decoder hardware by an order of magnitude relative to the state of the art…

Hardware Architecture · Computer Science 2015-05-20 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross