Polar coded probabilistic amplitude shaping for short packets

Prinz, Tobias; Yuan, Peihong; Böcherer, Georg; Steiner, Fabian; İşcan, Onurcan; Böhnke, R.; Xu, Wen

doi:10.1109/spawc.2017.8227653

Cited by 28 publications

(24 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For SR-CCDM, the unranking algorithms have a serialism of min(w, n − w), and ranking with colex does not require any iterations (see Algorithm 2), which we define as a serialism of 1. 7 In contrast, the AC-CCDM mapping and demapping algorithms are in the worst case serial in the length of their respective inputs, which is k for mapping and n for demapping. This DoS is summarized in Table IV.…”

Section: B Degree Of Serialism (Dos) Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching

Fehenberger

Millar

Koike‐Akino

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

A distribution matcher (DM) maps a binary input sequence into a block of nonuniformly distributed symbols. To facilitate the implementation of shaped signaling, fast DM solutions with high throughput and low serialism are required. We propose a novel DM architecture with parallel amplitudes (PA-DM) for which m−1 component DMs, each with a different binary output alphabet, are operated in parallel in order to generate a shaped sequence with m amplitudes. With negligible rate loss compared to a single nonbinary DM, PA-DM has a parallelization factor that grows linearly with m, and the component DMs have reduced output lengths. For such binary-output DMs, a novel constant-composition DM (CCDM) algorithm based on subset ranking (SR) is proposed. We present SR-CCDM algorithms that are serial in the minimum number of occurrences of either binary symbol for mapping and fully parallel in demapping. For distributions that are optimized for the additive white Gaussian noise (AWGN) channel, we numerically show that PA-DM combined with SR-CCDM can reduce the number of sequential processing steps by more than an order of magnitude, while having a rate loss that is comparable to conventional nonbinary CCDM with arithmetic coding.

show abstract

Section: B Degree Of Serialism (Dos) Comparisonmentioning

confidence: 99%

“…Mapping with SR has a serialism of min(w, n − w) = 36, and demapping always has serialism 1 for colex ordering. Thus, the total reduction in 7 The serial combination of the component subsequences is neglected here. serialism from the subset-ranking method is 190/37 ≈ 5.14.…”

Section: B Degree Of Serialism (Dos) Comparisonmentioning

confidence: 99%

Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching

Fehenberger

Millar

Koike‐Akino

et al. 2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…For many-to-one demappers more bits per symbol needs to be demapped which slightly increases the complexity of the demapper [41]. Compared to the other probabilistic schemes for polar codes such as in [25], [26], the IPPC scheme does not require an additional shaping encoder or shaping decoder. Moreover, with the IPPC scheme very fine granularity in rate step can be achieved by changing the number of parity bits in polar code, which can be realized without any additional hardware complexity and latency at the receiver.…”

Section: Systematic Polarmentioning

confidence: 99%

“…Multi-level polar codes combined with PAS and DM have been studied in [25] for short packets. This combination increases the latency and complexity at the transmitter and receiver due to the use of DM and multi-level decoding.…”

mentioning

confidence: 99%

An Experimental Demonstration of Rate-Adaptation Using Shaped Polar Codes for Flexible Optical Networks

Iqbal

Silva

Yankov³

et al. 2019

J. Lightwave Technol.

View full text Add to dashboard Cite

In this paper, we propose a polar-coded transmission system with adjustable data rate for coherent optical transmission employing quadrature amplitude modulation (QAM). The proposed system is based on a many-to-one constellation shaping method for achieving a range of data rates with arbitrarily small rate steps. An implicitly punctured polar-coded modulation system is then designed by combining polar coded bit-interleaved coded modulation system (BICM) with many-to-one labellings. The scheme is experimentally evaluated in a wavelength division multiplexed (WDM) system with five carriers modulated at 16 GBaud with polarization multiplexed (PM) 256QAM. Data rates ranging from 121 Gbps to 182 Gbps per carrier are experimentally demonstrated and the system can be directly extended to achieve higher data rates. Synchronization and equalization of PM-256QAM received symbols is performed with a pilot rate of 5%. The experimental results show 1.2 dB of shaping gain over the conventionally punctured polar codes in the optical back-to-back scenario. The maximum transmission system reach is increased by 200 km to 400 km w.r.t the conventionally punctured polar codes. It is shown that the rate adaptation does not require a change of modulation format and/or underlying forward error-correction (FEC) code. Finally, the performance of all 5 WDM channels is validated for the optimal input power.

show abstract

“…This approach is further extended to 5G NR polar codes in Reference 27. In Reference 28, the probabilistic amplitude shaping from Reference 24 is combined with polar codes, where a precoder is used for systematic encoding and a distribution matcher is used to shape the amplitudes of the ASK symbols. The receiver uses a multistage decoder (as in MLC) and a distribution dematcher to recover the message.…”

Section: Introductionmentioning

confidence: 99%

Sign‐bit shaping using polar codes

İşcan

Böhnke

2020

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

A new polar coding scheme for higher order modulation is presented. The proposed scheme is based on multi-level coding (MLC) with natural binary labeling, where the highest bit-level (called the sign-bit) is generated depending on the previous bit-levels such that the modulated symbols approach to a target distribution to reduce shaping loss. With polar codes, the scheme can be realized by replacing the polar encoder in the sign-bit level by a successive cancellation (SC) decoder so that the overall complexity does not increase compared to a conventional MLC scheme. Numerical simulations show that compared to conventional transmission with uniform symbol distribution, significant performance improvements can be obtained using such a sign-bit shaping scheme. By employing more complex decoders, such as the SC list (SCL) decoder which can operate across bit levels, the proposed scheme can outperform Gallager's random coding bound.

show abstract

Polar coded probabilistic amplitude shaping for short packets

Cited by 28 publications

References 9 publications

Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching

Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching

An Experimental Demonstration of Rate-Adaptation Using Shaped Polar Codes for Flexible Optical Networks

Sign‐bit shaping using polar codes

Contact Info

Product

Resources

About