Apresentacao Robert ISWCS2019

Abstract Introdution Polar Codes Uniform Polarization Channel: Arikan Construction Non-Uniform Polarization Channel Propose
Non-Uniform Channel Polarization and Design of

Rate-Compatible Polar Codes
Robert M. Oliveira and Rodrigo C. de Lamare
18 de agosto de 2019

Non-Uniform Channel Polarization and Design of Rate-Compatible Polar Codes
Summary
Abstract
Introdution
Polar Codes
Uniform Polarization Channel: Arikan Construction
Non-Uniform Polarization Channel
Proposed NUPGA Design Algorithm
Simulation Results
Conclusions

Abstract
In this paper, we present the concept of non-uniform channel

polarization and a scheme for rate-compatible polar code
construction for any codeword length using additive white Gaussian
noise (AWGN) channels and the successive cancellation and list
decoders. A Non-Uniform Polarization technique based on the
Gaussian Approximation (NUPGA) is developed and an efficient
rate-compatible design technique is devised to choose the best
channels for transmission by a process of re-polarization of the
codeword with the desired length. Simulations illustrate the
proposed NUPGA design against existing rate-compatible
techniques.
1
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
2
Introdution
I Polar codes proposed by Arikan [1] in 2009 are based on the

phenomenon called channel polarization.
I They are low-complexity codes and with the SC decoder can
achieve channel capacity as the code length approaches
infinity.
I A typical construction of conventional polar codes is based on
the Kronecker product, restricted to lengths 2n (n = 1, 2, ...).
3
Construction for AWGN
I Bhattacharyya Bounds (Heuristic BEC)

I Monte-Carlo Method
I Density Evolution
I Tal and Vardy Estimation
I Gaussian Approximation
I Polarization Weigth algorithm
4
For arbitrary lengths
I Polar codes with arbitrary lengths can be obtained by

shortening, puncturing or extension techniques.
I Shortening polar codes can be decoded in a similar way to SC
and SCL decoding for conventional polar codes.
I Column Weights (CW) method
I Reversal Quasi-Uniform Puncturing scheme (RQUP)
I Polarization-Driven (PD) criterion
I and new: Non-Uniform Polarization technique based on the
Gaussian Approximation (NUPGA)
5
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
6
Polar Encoding
I Generator Matrix Gn = Bn F⊗l
I for any n = 2l as l ≥ 1, where Bn is a bit-reversal matrix

and

⊗l 1 0
F is the nth Kronecker power of the matrix F = 1 1 .
I Combine two sequences, where uA contains the information

bits and uAc contains the frozen bits, the indices are collected
in set A and its complement set Ac .
I xn1 = un1 Bn F⊗l
7
Polar Decoding
I Successive cancellation (SC) decoding
I Low complexity, simple decoding structure
I Proven to achieve the channel capacity when the code length
is large enough
I Under practical finite length performance is not satisfactory
I SC list (SCL) decoding algorithm
I Improves SC decoding algorithm
I Achieves the ML performance with rather low complexity
I CRC-aided SCL (CA-SCL) decoding algorithm
I It is a common practice in the literature that CRC bits are
embedded in the information sequence
I Use of prior information of CRC to make decision in the list
obtained by SCL decoding
I Achieves comparable and even better performance against
Turbo/LDPC codes
8
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
9
Arikan Construction
u1 x1 y1
W
u2 x2 y2
W
I Polarization of channels with unique distribution of the

Bhattacharyya parameter.
Channel W N (y1N |x1N ) = N
Q
i=1 W (yi |xi )
I
I SymmetricPCapacity
P 1 W (y |x)
I (W ) = 2 W (y |x)log 1
W (y |0)+ 12 W (y |1)
y ∈Y x∈X 2
P p
I the Bhattacharyya parameter Z0 = W (y |0)W (y |1)
y ∈Y
10
Arikan Construction
(1)
W8 = W000
(1)
W4 = W00
(2)
W8 = W001
(1)
W2 = W0
(3)
W8 = W010
0 (2)
W4 = W01
(4)
W8 = W011
W
(5)
W8 = W100
(3)
W4 = W10
1 (6)
W8 = W101
(2)
W2 = W1
(7)
W8 = W110
(4)
W4 = W11
(8)
W8 = W111
PN (i)
i=1 I (WN ) = NI (W )
I
PN (i)
I
i=1 Z (WN ) ≤ NZ (W )
11
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
12
Non-Uniform Construction
u1 x1 y1
W(1)
u2 x2 W(2) y2
I Polarization of channels with arbitrary distribution of the

Bhattacharyya parameter.
0 0 0 Q 0
I Channel W N (y1N |x1N ) = N i=1 W(i) (yi |xi )
I Symmetric Capacity
P P 1 W(i) (y |x)
I (W(i) ) = 2 W(i) (y |x)log 1
W(i) (y |0)+ 12 W(i) (y |1)
y ∈Y x∈X 2
I the Bhattacharyya parameter

P q
Z (W(i) ) = W(i) (yi |0)W(i) (yi |1)
yi ∈Y
13
Non-Uniform Construction
W(1) W (1)
W(2) W (2)
W(3) W (3)
W(4) W (4)
W(5) W (5)
W(6) W (6)
W(7) W (7)
W(8) W (8)
g function
PN 0 (i) Pf N
function
0
I
i=1 I (WN0 ) = i=1 I (W(i) )
PN 0 (i) PN 0
i=1 Z (WN 0 ) ≤ i=1 Z (W(i) )
I
14
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
15
Key Idea
I The key idea of the NUPGA is to shorten the codeword by
removing the bits that correspond to the channels with
smallest values of polarization index. The bits of information
must be rearranged in the codeword according to the
re-polarization of the remaining channel bits, with proposed
method.
I Use the Gaussian Approximation Construction
( (2i−1) (i) (i)
Z (WN 0 ) = φ−1 (1 − (1 − φ(Z (W1 )))(1 − φ(Z (W2 ))))
(2i) (i) (i)
Z (WN 0 ) = Z (W1 )Z (W2 ).
( (1)
exp(−0.4527x (0.86) + 0.0218) if 0 < x ≤ 10
φ(x) = p π 10 x
(2)
x (1 − 7x ) exp(− 4 ) if x > 10
16
Algorithm
17
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
18
Simulation
I Show the performance of the original Arikan’s polar codes [7] with
length N = 512 (MC), and their rate-compatible versions operating
at rate R = 1/2 with M = 320 and K = 160 using the approaches
of Wang [12], Niu [13], Oliveira [14] and the proposed NUPGA
technique.
I Show the performance of a codeword of length M = 400, K = 200
for the rate-compatible designs and CA-SCL with L = 16.
I Show the performance of a codeword of length M = 400, K = 50,
CA-SCL with L = 16 and CRC with length 24 in a system operating
with rate R = 1/4.
[7] H. Vangala, E. Viterbo and Y. Hong, ”A Comparative Study of Polar Code Constructions for the AWGN
Channel”, https://arxiv.org/pdf/1501.02473.pdf, Jan 2015.
[12] R.Wang and R. Liu, ”A Novel Puncturing Scheme for Polar Codes”, IEEE Communications Letters, vol. 18, no.
12, pp. 2081-2084, Oct 2014.
[13] K. Niu et al., ”Rate-Compatible Punctured Polar Codes: Optimal Construction Based on Polar Spectra”,
https://arxiv.org/pdf/1612.01352, Dec 2017.
[14] R. M. Oliveira ; R. C. de Lamare, ”Rate-Compatible Polar Codes Based on Polarization-Driven Shortening”,
IEEE Communications Letters, vol. 22, no. 10, pp. 1984-1987, 2018 19
Performance of polar codes with N = 512 and

rate-compatible codewords with M = 320 and K = 160
10 0 10 0
10 -1
10 -1
-2
10
Frame Error Rate

Bit Error Rate
10 -3 10 -2
10 -4
10 -3
320/160 - NUPGA 320/160 - NUPGA
-5 320/160 - [13] 320/160 - [13]
10
320/160 - [14] 320/160 - [14]
512/160 - [7] 512/160 - [7]
320/160 - [12] 320/160 - [12]
10 -6 10 -4
0 1 2 3 4 0 1 2 3 4
Eb/N 0 in dB Eb/N 0 in dB 20
Performance of polar codes with M = 400, K = 200 and

CA-SCL with L = 16
10 0 10 0
10 -1
10 -1
Frame Error Rate

Bit Error Rate
10 -2
10 -3
10 -2
10 -4 GA shortened [12] GA shortened [12]

NUPGA NUPGA
10 -5 10 -3
0 1 2 3 4 0 1 2 3 4
E b /N0 in dB E b /N0 in dB
21
Performance of polar codes with M = 400 and K = 50

using CA-SCL with L = 16 and CRC = 24
10 0
10 -1
Frame Error Rate

Bit Error Rate
10 -2
10 -1
GA shortened [12] GA shortened [12]

NUPGA NUPGA
0 0.5 1 1.5 2 0 0.5 1 1.5 2

E b /N0 in dB E b /N0 in dB
22
Summary
Abstract
Introdution
Polar Codes
Simulation Results
Conclusions
23
Conclusions
I We have proposed a rate-compatible scheme for constructing polar

codes for any size using a non-uniform channel polarization
technique.
I We have then developed the NUPGA code design algorithm based
on the non-uniform channel polarization and the GA technique.
I The standard construction based on uniform polarization with
N = 2n is limited to the integer values n. With the proposed
NUPGA algorithm we can design polar codes for any code length.
I Simulations illustrate the excellent performance of NUPGA for short
codes is quite competitive as compared to existing
punctured/shorted rate-compatible polar codes.
24

Apresentacao Robert ISWCS2019

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Apresentacao Robert ISWCS2019

Загружено:

Авторское право:

Доступные форматы

Abstract Introdution Polar Codes Uniform Polarization Channel: Arikan Construction Non-Uniform Polarization Channel Propose

Non-Uniform Channel Polarization and Design of

Robert M. Oliveira and Rodrigo C. de Lamare

Robert M. Oliveira and Rodrigo C. de Lamare

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

Robert M. Oliveira and Rodrigo C. de Lamare

In this paper, we present the concept of non-uniform channel

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

I Polar codes proposed by Arikan [1] in 2009 are based on the

Construction for AWGN

I Bhattacharyya Bounds (Heuristic BEC)

For arbitrary lengths

I Polar codes with arbitrary lengths can be obtained by

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

I Generator Matrix Gn = Bn F⊗l

I for any n = 2l as l ≥ 1, where Bn is a bit-reversal matrix

I Combine two sequences, where uA contains the information

I xn1 = un1 Bn F⊗l

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

I Polarization of channels with unique distribution of the

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

I Polarization of channels with arbitrary distribution of the

I the Bhattacharyya parameter

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

Performance of polar codes with N = 512 and

Frame Error Rate

Performance of polar codes with M = 400, K = 200 and

Frame Error Rate

10 -4 GA shortened [12] GA shortened [12]

Performance of polar codes with M = 400 and K = 50

Frame Error Rate

GA shortened [12] GA shortened [12]

0 0.5 1 1.5 2 0 0.5 1 1.5 2

Uniform Polarization Channel: Arikan Construction

Non-Uniform Polarization Channel

Proposed NUPGA Design Algorithm

I We have proposed a rate-compatible scheme for constructing polar

Вам также может понравиться