English
Related papers

Related papers: Universal Polar Coding for Parallel Gaussian Chann…

200 papers

Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either…

Information Theory · Computer Science 2015-11-17 Erdal Arıkan

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

We consider the problem of determining the trade-off between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters…

Information Theory · Computer Science 2012-05-15 Ali Goli , S. Hamed Hassani , Rudiger Urbanke

In a recent work, a capacity-achieving scheme for the common-message two-user MIMO broadcast channel, based on single-stream coding and decoding, was described. This was obtained via a novel joint unitary triangularization which is applied…

Information Theory · Computer Science 2011-06-01 Anatoly Khina , Ayal Hitron , Uri Erez

In this work, a novel data-driven methodology for designing polar codes for channels with and without memory is proposed. The methodology is suitable for the case where the channel is given as a "black-box" and the designer has access to…

Information Theory · Computer Science 2023-09-07 Ziv Aharoni , Bashar Huleihel , Henry D. Pfister , Haim H. Permuter

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

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

This paper characterizes the capacity region of Gaussian MIMO broadcast channels (BCs) with per-antenna power constraint (PAPC). While the capacity region of MIMO BCs with a sum power constraint (SPC) was extensively studied, that under…

Information Theory · Computer Science 2017-05-18 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

We consider the problem of transmitting a source over an infinite-bandwidth additive white Gaussian noise channel with unknown noise level under an input energy constraint. We construct a universal scheme that uses modulo-lattice modulation…

Information Theory · Computer Science 2024-10-28 Omri Lev , Anatoly Khina

This paper presents polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is…

Information Theory · Computer Science 2016-11-15 Marco Mondelli , S. Hamed Hassani , Igal Sason , Rüdiger Urbanke

We introduce a new family of polar-like codes, called Partially Polarized Polar (PPP) codes. PPP codes are constructed from conventional polar codes by selectively pruning polarization kernels, thereby modifying the synthesized bit-channel…

Information Theory · Computer Science 2026-01-23 Arman Fazeli , Mohammad M. Mansour , Ziyuan Zhu , Louay Jalloul

A practical rate-matching system for constructing rate-compatible polar codes is proposed. The proposed polar code circular buffer rate-matching is suitable for transmissions on communication channels that support hybrid automatic repeat…

Information Theory · Computer Science 2017-11-15 Mostafa El-Khamy , Hsien-Ping Lin , Jungwon Lee , Inyup Kang

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

The min-sum approximation is widely used in the decoding of polar codes. Although it is a numerical approximation, hardly any penalties are incurred in practice. We give a theoretical justification for this. We consider the common case of a…

Information Theory · Computer Science 2025-03-04 Nir Chisnevski , Ido Tal , Shlomo Shamai

The paper provides a new perspective on peak- and average-constrained Gaussian channels. Such channels model optical wireless communication (OWC) systems which employ intensity-modulation with direct detection (IM/DD). First, the paper…

Information Theory · Computer Science 2023-03-20 Sarah Bahanshal , Ahmad Abdel-Qader , Anas Chaaban

A challenging problem related to the design of polar codes is "robustness against channel parameter variations" as stated in Ar{\i}kan's original work. In this paper, we describe how the problem of robust polar code design can be viewed as…

Information Theory · Computer Science 2013-05-15 Mine Alsan

Polar codes have been gaining a lot of interest due to it being the first coding scheme to provably achieve the symmetric capacity of a binary memoryless channel with an explicit construction. However, the main drawback of polar codes is…

Information Theory · Computer Science 2019-11-11 Heshani Gamage , Vismika Ranasinghe , Nandana Rajatheva , Matti Latva-aho

This work is on fast encoding and decoding of polar codes. We propose and detail 8-bit and 16-bit parallel decoders that can be used to reduce the decoding latency of the successive-cancellation decoder. These decoders are universal and can…

Information Theory · Computer Science 2017-04-04 Muhammad Hanif , Masoud Ardakani

A probabilistic shaping method for multi-level coding (MLC) is presented, where the transmitted symbols are forced to have a shaped non-uniform distribution. It is shown that shaping only a single bit-level suffices to compensate for most…

Information Theory · Computer Science 2018-12-20 Onurcan İşcan , Ronald Böhnke , Wen Xu

Massive multi-user (MU) multiple-input multiple- output (MIMO) is widely believed to be a core technology for the upcoming fifth-generation (5G) wireless communication standards. The use of low-precision digital-to-analog converters (DACs)…

Information Theory · Computer Science 2016-12-09 Sven Jacobsson , Giuseppe Durisi , Mikael Coldrey , Tom Goldstein , Christoph Studer