Related papers: Polarization-Dependent Loss Mitigation via Orthogo…
The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…
The necessity of accurate channel estimation for Successive and Parallel Interference Cancellation is well known. Iterative channel estimation and channel decoding (for instance by means of the Expectation-Maximization algorithm) is…
$2^m$-ary modulation creates $m$ bit channels which are neither independent nor identical, and this causes problems when applying polar coding because polar codes are designed for independent identical channels. Different from the existing…
This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency…
This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed…
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…
Transmitting polarization multiplexed carrier makes the receiver of a coherent system local oscillator-less and frequency offset-free. A polarization multiplexed carrier based self-homodyne (PMC-SH) system with an adaptive polarization…
Polar codes have emerged as the most favorable channel codes for their unique capacity-achieving property. To date, numerous works have been reported for efficient design of polar codes decoder. However, these prior efforts focused on…
This paper presents "Predictive Pipelined Decoding (PPD)," an approach that speeds up greedy decoding in Large Language Models (LLMs) while maintaining the exact same output as the original decoding. Unlike conventional strategies, PPD…
We study faulty successive cancellation decoding of polar codes for the binary erasure channel. To this end, we introduce a simple erasure-based fault model and we show that, under this model, polarization does not happen, meaning that…
Polar coding over a class of binary discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the capacity of convex and one-sided classes of symmetric channels.
Orthogonal frequency division multiplexing (OFDM) is critical for high-speed visible light communication (VLC) transmission; however, it suffers from a high peak-to-average power ratio (PAPR) problem. Among PAPR reduction techniques,…
In this paper, we first propose an universal polar coding scheme for parallel Gaussian channels with non-binary inputs. It is assumed that the encoder knows only the sum capacity of M parallel channels instead of the capacity of any single…
Information-theoretic work for wiretap channels is mostly based on random coding schemes. Designing practical coding schemes to achieve information-theoretic security is an important problem. By applying the two recently developed…
Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…
A novel precoding method based on supervised deep neural networks is introduced for the multiple-input multiple-output Gaussian wiretap channel. The proposed deep learning (DL)-based precoding learns the input covariance matrix through…
Arikan's recursive code construction is designed to polarize a collection of memoryless channels into a set of good and a set of bad channels, and it can be efficiently decoded using successive cancellation. It was recently shown that the…
Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and…
A long-standing vision of backscatter communications is to provide long-range connectivity and high-speed transmissions for batteryless Internet-of-Things (IoT). Recent years have seen major innovations in designing backscatters toward this…