Polar Codes for Probabilistic Amplitude Shaping

Similar documents
Polar Codes with Integrated Probabilistic Shaping for 5G New Radio

IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 63, NO. 12, DECEMBER In the DVB-S2 standard, complex amplitude phase shift keying

THE ever-increasing demand to accommodate various

Polar Codes for Magnetic Recording Channels

Bit-permuted coded modulation for polar codes

P X (x) =P Xν (x) with ν : E[ X ν 2 ] = P. (9)

THE idea behind constellation shaping is that signals with

Capacity-Achieving Rateless Polar Codes

Coded Modulation for Next-Generation Optical Communications

An Improved Design of Gallager Mapping for LDPC-coded BICM-ID System

Coding and Modulation

On Performance Improvements with Odd-Power (Cross) QAM Mappings in Wireless Networks

Error Control Coding. Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria

Error Patterns in Belief Propagation Decoding of Polar Codes and Their Mitigation Methods

Performance of Nonuniform M-ary QAM Constellation on Nonlinear Channels

Outline. Communications Engineering 1

Performance comparison of convolutional and block turbo codes

Code Design for Incremental Redundancy Hybrid ARQ

Punctured vs Rateless Codes for Hybrid ARQ

MULTILEVEL CODING (MLC) with multistage decoding

Short-Blocklength Non-Binary LDPC Codes with Feedback-Dependent Incremental Transmissions

Improved concatenated (RS-CC) for OFDM systems

Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing

High-performance Parallel Concatenated Polar-CRC Decoder Architecture

On the Construction and Decoding of Concatenated Polar Codes

Low-complexity Receiver for Multi-Level Polar Coded Modulation in Non-Orthogonal Multiple Access

Combining Modern Codes and Set- Partitioning for Multilevel Storage Systems

Efficient Design and Decoding of Polar Codes

n Based on the decision rule Po- Ning Chapter Po- Ning Chapter

Study of Turbo Coded OFDM over Fading Channel

Performance Comparison of Short-Length Error-Correcting Codes

SIMULATIONS OF ERROR CORRECTION CODES FOR DATA COMMUNICATION OVER POWER LINES

Hamming net based Low Complexity Successive Cancellation Polar Decoder

Capacity achieving nonbinary LDPC coded non-uniform shaping modulation for adaptive optical communications.

Decoding of Block Turbo Codes

ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010)

Protograph-Based LDPC Code Design for Probabilistic Shaping with On-Off Keying

A Capacity Achieving and Low Complexity Multilevel Coding Scheme for ISI Channels

Lab/Project Error Control Coding using LDPC Codes and HARQ

EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1.

Chapter 3 Convolutional Codes and Trellis Coded Modulation

Turbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals

Noncoherent Digital Network Coding using M-ary CPFSK Modulation

Multilevel RS/Convolutional Concatenated Coded QAM for Hybrid IBOC-AM Broadcasting

BERROU et al. introduced turbo codes in 1993 [1], which

Low Complexity Belief Propagation Polar Code Decoder

CT-516 Advanced Digital Communications

Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes

Bit-Wise Decoders for Coded Modulation and Broadcast Coded Slotted ALOHA. Mikhail Ivanov

High-Rate Non-Binary Product Codes

A rate one half code for approaching the Shannon limit by 0.1dB

Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes

Lecture #2. EE 471C / EE 381K-17 Wireless Communication Lab. Professor Robert W. Heath Jr.

Definition1. Given δ 1,δ 2 R such that 0 < δ 1 δ 2 < 1, for all i [N], we call a channelw (i)

Performance of Combined Error Correction and Error Detection for very Short Block Length Codes

A REVIEW OF CONSTELLATION SHAPING AND BICM-ID OF LDPC CODES FOR DVB-S2 SYSTEMS

Department of Electronic Engineering FINAL YEAR PROJECT REPORT

Advanced channel coding : a good basis. Alexandre Giulietti, on behalf of the team

Design of Rate-Compatible Parallel Concatenated Punctured Polar Codes for IR-HARQ Transmission Schemes

LDPC codes for OFDM over an Inter-symbol Interference Channel

Performance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding

On Bit-Wise Decoders for Coded Modulation. Mikhail Ivanov

Novel BICM HARQ Algorithm Based on Adaptive Modulations

arxiv: v1 [cs.it] 31 Aug 2015

IN 1993, powerful so-called turbo codes were introduced [1]

ENCODER ARCHITECTURE FOR LONG POLAR CODES

Dual-Mode Decoding of Product Codes with Application to Tape Storage

CHANNEL polarization, proposed by Arikan, is a method

Chapter 1 Coding for Reliable Digital Transmission and Storage

SNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding

Bridging the Gap Between Parallel and Serial Concatenated Codes

Error Correcting Codes for Cooperative Broadcasting

Ultra high speed optical transmission using subcarrier-multiplexed four-dimensional LDPCcoded

XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes

Power Efficiency of LDPC Codes under Hard and Soft Decision QAM Modulated OFDM

Low Complexity List Successive Cancellation Decoding of Polar Codes

Construction of Efficient Amplitude Phase Shift Keying Constellations

Probabilistic Amplitude Shaping with Hard Decision Decoding and Staircase Codes

Digital Television Lecture 5

Multiple-Bases Belief-Propagation for Decoding of Short Block Codes

Bit-Interleaved Polar Coded Modulation with Iterative Decoding

ECE 6640 Digital Communications

High Order APSK Constellation Design for Next Generation Satellite Communication

High Speed Turbo Tcm Ofdm For Uwb And Powerline System

An Iterative Noncoherent Relay Receiver for the Two-way Relay Channel

Receiver Design for Noncoherent Digital Network Coding

PERFORMANCE OF TWO LEVEL TURBO CODED 4-ARY CPFSK SYSTEMS OVER AWGN AND FADING CHANNELS

Adaptive Sliding-Window Coded Modulation in Cellular Networks

Information-Theoretic Metrics in Coherent Optical Communications and their Applications

A Survey of Advanced FEC Systems

3GPP TSG RAN WG1 Meeting #85 R Decoding algorithm** Max-log-MAP min-sum List-X

Performance Evaluation of Iterative Layered Space Time Receiver in LTE Uplink

Blind Detection of Polar Codes

IEEE C /02R1. IEEE Mobile Broadband Wireless Access <

OFDM RECEIVERS WITH ITERATIVE NONLINEAR DISTORTION CANCELLATION

A low cost soft mapper for turbo equalization with high order modulation

MIMO-OFDM in Rayleigh Fading Channel with LDPC

Problem Sheet 1 Probability, random processes, and noise

Goa, India, October Question: 4/15 SOURCE 1 : IBM. G.gen: Low-density parity-check codes for DSL transmission.

Chalmers Publication Library

Transcription:

Polar Codes for Probabilistic Amplitude Shaping Tobias Prinz tobias.prinz@tum.de Second LNT & DLR Summer Workshop on Coding July 26, 2016 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 1/16

Outline 1 Motivation 2 Polar Codes Polarization Polar Codes for BPSK Polar Codes for Higher-Order Modulation 3 Probabilistic Amplitude Shaping (PAS) 4 Numerical Results 5 Conclusions Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 2/16

Polar Codes Polar Codes achieve the symmetric capacity of binary-input memoryless channels. low-complexity encoding algorithms (O(N log N)) low-complexity decoding algorithms (O(N log N)) very good performance for finite lengths with some modifications (outer CRC-code) Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 3/16

Probabilistic Shaping 3.5 3 C(P) = 1 2 log 2(1 + P/1) 4-ASK uniform 8-ASK uniform Rate [bits/channel use] 2.5 2 1.5 1 0.5 6 8 10 12 14 16 18 20 22 SNR [db] Figure 1 : Rates for uniform and shaped ASK Constellations. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 4/16

Probabilistic Shaping P Xuni (x) x Figure 1 : Rates for uniform and shaped ASK Constellations. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 4/16

Probabilistic Shaping P Xuni (x) x P X (x) x Figure 1 : Rates for uniform and shaped ASK Constellations. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 4/16

Probabilistic Shaping Rate [bits/channel use] 3.5 3 2.5 2 1.5 C(P) = 1 2 log 2(1 + P/1) 4-ASK shaped 4-ASK uniform 8-ASK shaped 8-ASK uniform 1 0.5 6 8 10 12 14 16 18 20 22 SNR [db] Figure 1 : Rates for uniform and shaped ASK Constellations. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 4/16

Polarization 1 u 1 + + P Y X y 1 u 2 + P Y X y 2 u 3 + P Y X y 3 u 4 P Y X y 4 Figure 2 : Polar Transformation: N = 4. c 1 c 2 c 3 c 4 Polar Transformation: c = ug G = F m m = log 2 N [ ] 1 0 F = 1 1 Observation (Polarization) Most of the bit-channels U i (U1 i 1, Y1 N ) are either good channels I (U i ; Y1 N Ui 1 1 ) 1 or bad channels I (U i ; Y1 N Ui 1 1 ) 0. 1 E. Arıkan, Channel polarization: A method for constructing capacity-achieving codes, IEEE Trans. Inf. Theory, 2009 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 5/16

Polar Codes Definition ((N,k) - Polar Code) An (N = 2 m, k) Polar Code is defined by the Polarization c = ug, where [ ] G = F m 1 0, m = log 2 N, F = 1 1 and a set of N k indices in u which correspond to frozen bits. The frozen bits are usually set to zero. The unfrozen bits of u contain the data to be transmitted. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 6/16

Performance of Polar Codes 10 0 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations 10 1 10 2 FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding 10 2 FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding Polar Code: SCL Decoding L = 2 2 10 2 FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall 2 I. Tal, A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory,2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding Polar Code: SCL Decoding L = 2 2 Polar Code: SCL Decoding L = 4 10 2 FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall 2 I. Tal, A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory,2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 10 2 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding Polar Code: SCL Decoding L = 2 2 Polar Code: SCL Decoding L = 4 Polar Code: SCL Decoding L = 8 FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall 2 I. Tal, A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory,2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 10 2 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding Polar Code: SCL Decoding L = 2 2 Polar Code: SCL Decoding L = 4 Polar Code: SCL Decoding L = 8 Polar Code: SCL Decoding L = 32 FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall 2 I. Tal, A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory,2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 10 2 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding Polar Code: SCL Decoding L = 2 2 Polar Code: SCL Decoding L = 4 Polar Code: SCL Decoding L = 8 Polar Code: SCL Decoding L = 32 Polar Code: ML lower bound FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall 2 I. Tal, A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory,2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Performance of Polar Codes 10 0 10 1 10 2 WiMax LDPC Code: 100 iterations LTE-Turbo (punctured) code: log-map: 5 iterations Polar Code: SC Decoding Polar Code: SCL Decoding L = 2 2 Polar Code: SCL Decoding L = 4 Polar Code: SCL Decoding L = 8 Polar Code: SCL Decoding L = 32 Polar Code: ML lower bound Polar Code with CRC: L = 32, 16-CRC FER 10 3 10 4 10 5 10 6 1 1.5 2 2.5 3 SNR [db] Figure 3 : rate 1/2. Performance of Polar Codes of length N = 1024 with overall 2 I. Tal, A. Vardy, List decoding of polar codes, IEEE Trans. Inf. Theory,2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 7/16

Compound Polar Codes for Higher-Order Modulation 3 u nc 1 Arıkan Polar Transformation + c 1 + c 2 + c 3. Bit Level One u u 2nc nc+1 Arıkan Polar Transformation + c nc+1 + c nc+2 + c nc+3. Bit Level Two Mapper x 1,..., x nc u 3nc 2nc+1 Arıkan Polar Transformation c 2nc+1 c 2nc+2 c 2nc+3. c 3nc Bit Level Three Figure 4 : Compound Polar Code for 8-ASK 3 H. Mahdavifar et al., Polar coding for bit-interleaved coded modulation, IEEE Trans. Veh. Technol., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 8/16

Probabilistic Amplitude Shaping (PAS) 4 2 m -ASK constellation: label X by B 1 B 2... B m (Gray labeling) PX = PB1B2B3 000 001 011 010 110 111 101 100 X = B1B2B3 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 9/16

Probabilistic Amplitude Shaping (PAS) 4 2 m -ASK constellation: label X by B 1 B 2... B m (Gray labeling) P X is symmetric X = sign(x ) X = S A PX = PB1B2B3 000 001 011 010 110 111 101 100 X = B1B2B3 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 9/16

Probabilistic Amplitude Shaping (PAS) 4 2 m -ASK constellation: label X by B 1 B 2... B m (Gray labeling) P X is symmetric X = sign(x ) X = S A P A ( x ) = 2P X ( x ) PA = PB2B3 10 11 01 00 A = B2B3 PX = PB1B2B3 000 001 011 010 110 111 101 100 X = B1B2B3 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 9/16

Probabilistic Amplitude Shaping (PAS) 4 2 m -ASK constellation: label X by B 1 B 2... B m (Gray labeling) P X is symmetric X = sign(x ) X = S A P A ( x ) = 2P X ( x ) interpret B 1 as uniformly distributed sign PA = PB2B3 10 11 01 00 A = B2B3 B1 uniform PX = PB1B2B3 000 001 011 010 110 111 101 100 X = B1B2B3 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 9/16

PAS encoding schemes 4 block transmission with n c symbols per block P A A nc = A 1... A nc X 1... X nc b(a 1)... b(a nc ) b(s 1)... b(s nc ) b( ) P b 1 ( ) S 1... S nc 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 10/16

PAS encoding schemes 4 block transmission with n c symbols per block P A A nc = A 1... A nc X 1... X nc b(a 1)... b(a nc ) b(s 1)... b(s nc ) b( ) P b 1 ( ) S 1... S nc rate R = H(A) coderate c = m 1 m 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 10/16

PAS encoding schemes 4 block transmission with n c symbols per block P A A nc = A 1... A nc X 1... X nc b(a 1)... b(a nc ) b(s γnc+1)... b(s nc ) b( ) P b 1 ( ) S 1... S nc P U b(s 1)... b(s γnc ) rate R = H(A) coderate c = m 1 m 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 10/16

PAS encoding schemes 4 block transmission with n c symbols per block P A A nc = A 1... A nc X 1... X nc b(a 1)... b(a nc ) b(s γnc+1)... b(s nc ) b( ) P b 1 ( ) S 1... S nc P U b(s 1)... b(s γnc ) rate R = H(A) coderate c = m 1 m extended PAS scheme: rate R = H(A) + γ coderate c = m 1+γ m 4 G. Böcherer et al., Bandwidth efficient and rate-matched low-density parity-check coded modulation, IEEE Trans. Commun., 2015 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 10/16

Bit-Metric Decoding y 1 demapper L 1,1. L 1,m y 2 demapper L 2,1. L 2,m SCL decoder ĉ y nc demapper L nc,1. L nc,m Figure 5 : Bit-Metric Decoding (BMD) L i,j = log 2 p Y Bj (y i b i,j =0) p Y Bj (y i b i,j =1) }{{} channel likelihood Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 11/16

Bit-Metric Decoding y 1 demapper L 1,1. L 1,m y 2 demapper L 2,1. L 2,m SCL decoder ĉ y nc demapper L nc,1. L nc,m Figure 5 : Bit-Metric Decoding (BMD) L i,j = log 2 p Y Bj (y i b i,j =0) p Y Bj (y i b i,j =1) }{{} channel likelihood + log 2 P Bj (b i,j = 0) P Bj (b i,j = 1) }{{} a priori information Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 11/16

Results for n c = 512 10 0 10 1 10 2 10 3 FER 10 4 10 5 10 6 uniform Compound Polar Code: c=2/3 shaped Compound Polar Code: c=3/4 shaped punctured LTE-Turbo code: 10 iterations shaped WiMax-LDPC Code: 100 iterations Shannon s cone-packing achievability bound 5 10 7 10 10.5 11 11.5 12 12.5 13 13.5 14 14.5 15 SNR [db] Figure 6 : Frame error rate of a shaped 8-ASK Compound Polar Code with rate R = 2 bits per channel use under SCL Decoding with L = 32 and 16 CRC. 5 C. Shannon, Probability of error for optimal codes in a Gaussian channel, Bell Systems Tech. Journal, 1959 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 12/16

Results for n c = 512 4 3.5 3 C(P) 1 2 log 2(1 + P/1) Shannon s cone packing achievability bound meta-converse upper bound Uniform Compound Polar Code: 10-CRC Shaped Compound Polar Code (CCDM): 8-CRC bpcu 2.5 2 1.5 1 0.5 6 7 8 9 10 11 12 13 14 15 16 17 SNR [db] Figure 7 : Rate Curves for 8-ASK uniform and shaped Compound Polar Codes of blocklength n c = 512 with coderate c = 0.75 under SCL Decoding with L = 32. 6 Y. Polyanskiy et al., Channel coding rate in the finite blocklength regime, IEEE Trans. Inf. Theory, 2010 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 13/16

Results for n c = 512 1.6 1.58 1.56 1.54 C(P) 1 2 log 2(1 + P/1) Shannon s cone packing achievability bound meta-converse upper bound 6 Uniform Compound Polar Code: 10-CRC Shaped Compound Polar Code: 8-CRC bpcu 1.52 1.5 0.8 db 1.48 1.46 1.44 1.42 1.4 9.1 9.2 9.3 9.4 9.5 9.6 9.7 9.8 9.9 10 10.1 10.2 10.3 10.4 10.5 SNR [db] Figure 7 : Rate Curves for 8-ASK uniform and shaped Compound Polar Codes of blocklength n c = 512 with coderate c = 0.75 under SCL Decoding with L = 32. 6 Y. Polyanskiy et al., Channel coding rate in the finite blocklength regime, IEEE Trans. Inf. Theory, 2010 Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 13/16

Results for n c = 128 4 3.5 3 C(P) 1 2 log 2(1 + P/1) Shannon s cone packing achievability bound meta-converse upper bound Uniform Compound Polar Code: 8-CRC Compound Polar Code with PAS: 8-CRC bpcu 2.5 2 1.5 1 0.5 6 7 8 9 10 11 12 13 14 15 16 17 SNR [db] Figure 8 : Rate Curves for 8-ASK uniform and shaped Compound Polar Codes of blocklength n c = 128 with coderate c = 0.75 under SCL Decoding. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 14/16

Results for n c = 128 1.6 1.58 1.56 1.54 C(P) 1 2 log 2(1 + P/1) Shannon s cone packing achievability bound meta-converse upper bound Uniform Compound Polar Code: 8-CRC Compound Polar Code with PAS: 8-CRC bpcu 1.52 1.5 0.5 db 1.48 1.46 1.44 1.42 1.4 9.8 9.9 10 10.1 10.2 10.3 10.4 10.5 10.6 10.7 10.8 10.9 11 SNR [db] Figure 8 : Rate Curves for 8-ASK uniform and shaped Compound Polar Codes of blocklength n c = 128 with coderate c = 0.75 under SCL Decoding. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 14/16

Conclusions Polar Codes for PAS perform very close to the theoretical limits for intermediate lengths. Polar Codes for PAS can be constructed very efficiently. Future work: Code length constricted to powers of two combine Polar Codes for PAS with punctering schemes. Consider Polar Codes with multilevel coding and multistage decoding for PAS. Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 15/16

Thank you! Questions? Tobias Prinz Polar Codes for Probabilistic Amplitude Shaping 16/16