Related papers: Shaping Bits
We study the problem of constructing coded modulation schemes over multidimensional signal sets in Nakagami-$m$ block-fading channels. In particular, we consider the optimal diversity reliability exponent of the error probability when the…
In this paper, we propose a new signal organization method to work in the structure of the multi level coding (MLC). The transmit bits are divided into opportunistic bit (OB) and conventional bit (CB), which are mapped to the lower level-…
We develop a low-complexity coding scheme to achieve covert communications over binary-input discrete memoryless channels (BI-DMCs). We circumvent the impossibility of covert communication with linear codes by introducing non-linearity…
We develop efficient binary (i.e., 1-bit) and multi-bit coding schemes for estimating the scale parameter of $\alpha$-stable distributions. The work is motivated by the recent work on one scan 1-bit compressed sensing (sparse signal…
Rotation symmetric bosonic codes are an attractive encoding for qubits into oscillator degrees of freedom, particularly in superconducting qubit experiments. While these codes can tolerate considerable loss and dephasing, they will need to…
We analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order…
Field experiments are often difficult and expensive to make. To bypass these issues, industrial companies have developed computational codes. These codes intend to be representative of the physical system, but come with a certain amount of…
Continuous phase modulation (CPM) with 1-bit quantization at the receiver is promising in terms of energy and spectral efficiency. In this study, CPM waveforms with symbol durations significantly shorter than the inverse of the signal…
Map-making presents a significant computational challenge to the next generation of kilopixel CMB polarisation experiments. Years worth of time ordered data (TOD) from thousands of detectors will need to be compressed into maps of the T, Q…
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…
The polar codes are proven to be capacity-achieving and are shown to have equivalent or even better finite-length performance than the turbo/LDPC codes under some improved decoding algorithms over the additive white Gaussian noise (AWGN)…
An analysis of the diversity gain for bit-interleaved coded multiple beamforming (BICMB) method in millimeter-wave (mm-Wave) massive multiple-input multiple-output (MIMO) systems is carried out for both the single-user and multi-user…
Generative quantum machine learning models are trained to deduce the probability distribution underlying a given dataset, and to produce new, synthetic samples from it. The majority of such models proposed in the literature, like the…
A class of circular 64-QAM that combines 'geometric' and 'probabilistic' shaping aspects is presented. It is compared to square 64-QAM in back-to-back, single-channel, and WDM transmission experiments. First, for the linear AWGN channel…
A new coded modulation scheme is proposed. At the transmitter, the concatenation of a distribution matcher and a systematic binary encoder performs probabilistic signal shaping and channel coding. At the receiver, the output of a bitwise…
We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source emitting independent equally distributed bits, with 1…
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…
In this work, geometric shaping (GS) and probabilistic shaping (PS) for the AWGN channel is reviewed. Both approaches are investigated in terms of symbol-metric decoding (SMD) and bit-metric decoding (BMD). For GS, an optimization algorithm…
In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that these codes outperform individual block codes in certain…
The problem of designing bit-to-pattern mappings and power allocation schemes for orthogonal frequency-division multiplexing (OFDM) systems that employ subcarrier index modulation (IM) is considered. We assume the binary source conveys a…