Design and Performance of the Polar Coded
Modulation for High Mobility Communications
Peiyao Chen and Baoming Bai
State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China
Email: pychen@stu.xidian.edu.cn, and bmbai@mail.xidian.edu.cn
Abstract—With the development of the high-speed trains
(HST), high spectral efficiency and low latency in high mobility
scenarios have become an urgent demand. In this paper, we
consider bandwidth-efficient multilevel coding (MLC) based on
polar codes under high mobility scenarios. Since the use of a lot of
binary coding levels and large list sizes will lead to a high latency
for polar decoding, we first introduce a new kind of nonbinary
polar codes based on multiplicative repetition method. Then, we
employ the proposed codes as component codes for MLC scheme,
and optimize the design for high mobility scenarios with low
latency. Simulation results show that nonbinary polar coded MLC
scheme (with less coding levels) outperform LTE turbo codes with
high-order modulations, and can exhibit similar performance of
binary polar coded bit-interleaved coded modulation scheme but
with a smaller list size (reflecting low latency) over HST channels.
I. I NTRODUCTION
Since the increasing demand for traveling with high-speed
trains (HST), high mobility wireless communication, which
encounters challenges due to the Doppler effect with rapid
time variations, arouses much attention and exploration. Now
the communication system for train control and manage-
ment requires not only information transmission with high-
reliability and low-latency, but also high data rate. How to sat-
isfy the requirement of high spectral efficiency and low latency
in high mobility wireless communications is a challenging
problem for the design of channel coding and modulation
schemes. In [1], [2], LDPC codes and BMST with high-order
modulations were investigated for HST channels, respectively.
In this paper, we consider another class of modern channel
codes −− polar codes for high mobility communications.
As the first provably capacity-achieving codes, polar codes
[3] were proposed by Arıkan in 2008, which have explicit
coding structures as well as low encoding and decoding
complexity. By the polarization matrix and successive can-
cellation (SC) decoding, polarization effect exists. To improve
the error-correcting performance, successive cancellation list
(SCL) decoding was proposed in 2011 [4], [5], where L
paths were kept at each decoding tree level. For further
improvement, on one hand, concatenated polar codes were
presented, such as CRC-aided polar codes [4], [5], parity
check polar codes [6], and hash-polar codes [7]. On the other
hand, instead of using the generator matrix based on the
Arıkan’s kernel F2 = [ 11 01 ], polar codes constructed with
large exponent kernels were also investigated. In [8], the
construction of polar codes based on BCH generator matrices
978-1-5386-6355-4/18/$31.00 ©2018 IEEE
were presented. Binary kernels with maximum exponents of
dimensions up to sixteen were provided in [9]. Moreover,
nonbinary polar codes were considered, where in [10] and
[11], Şaşoǧlu et al. and Chiu proved that nonbinary polar
codes can polarize arbitrary q-ary input randomized channels,
respectively. Nonbinary polar codes with Reed-Solomon (RS)
kernels were proposed by Mori and Tanaka [12]. In 2016,
Cheng [13] et al. applied a four-dimensional RS matrix over
GF(4) as a polarized kernel, where simulation results showed
that four-dimensional RS matrix-based polar codes perform
better than binary polar codes with BPSK modulation over
the AWGN channel.
For high spectral efficiency, polar coded modulation was
also investigated in [14] - [18], where both multilevel coding
(MLC) and bit-interleaved coded modulation (BICM) schemes
were considered over AWGN channels. The outstanding per-
formance of polar codes over the AWGN channel suggests that
similar results should also be considered in other channels,
especially for the HST channel. In [19], the design of polar
codes for block fading channels was considered, by treating the
fading process as a natural polarization and combining modu-
lation, fading, and coding in a single entity. Bit-interleaved
polar coded OFDM for the machine-to-machine communi-
cation was considered in [20], where an efficient interleaver
and constellation shaping were introduced. In addition, error-
correcting performance of hash-polar coded modulation over
HST channels was investigated in [7]. Note that only polar
coded BICM schemes were studied in the above researches.
In this paper, we focus on MLC scheme for high mobility
scenarios. With the growing demand of high mobility wireless
communication, low decoding latency is required, which will
be effected by the coding levels and the list size in polar coded
MLC system. In order to reduce coding levels and list size for
low latency, we first propose a kind of nonbinary polar codes,
which are constructed based on multiplicative repetition (MR)
and have similar structure with Arıkan’s kernel-based binary
polar codes. This is an obvious advantage over the existing RS-
generator-matrix-based polar codes, which require much more
computations than ours due to their very different decoding
structure from that of the Arıkan’s polar codes. Then, by
employing the proposed nonbinary polar codes as component
codes, nonbinary polar coded MLC scheme is designed. Note
that though nonbinary polar codes combined directly with high
order modulations exhibit excellent performance, the decoding
complexity is too high, especially, the complexity will be in-
 u(1) c(1) frequency-domain symbols [ X] = {Xi ∈ X , 1 ≤ i ≤ Ns }.
Encoder for CC111
Suppose that E s = E |X i | 2
denotes the average transmit-
u(2) Encoder for CC11 c(2)
2
X IDFT CP ted energy per symbol, then, the average received SNR =
d u Partition Signal Interleaver
·
CRC
Mapper Insertion E /N = ρ E /N , where the spectral efficiency ρ = mR,

...
Encoder s 0 b 0
and E b represents the average energy per information bit. To
u( I ) Encoder for CC11 c( I )
I
HST Channel further against the fading, a random interleaver is applied.
h
With the use of inverse discrete Fourier transform (IDFT),
Decoder
for CC11
w time-domain transmitted symbols are obtained. A cyclic prefix
1

Decoder
(CP) of length Lcp > Ltap is inserted into the output of the
d̂ CRC MUX ... for CC11
2
Demapper Deinterleaver
Z Equalizer
Y DFT
CP IDFT for the elimination of intersymbol interference (ISI),
Removal
...

Decoder where Ltap denotes the number of taps used in the doubly
Decoder selective channel. The high mobility channel model proposed
for CC11
I
by Wang [21] is considered in this paper.
Fig. 1: System Model After CP removal, frequency-domain symbols Y = {Yi ∈
Y, 1 ≤ i ≤ Ns } are obtained with the use of discrete Fourier
transform (DFT) , i.e.,
creased with the increase of modulation order (corresponding YT = FhFH XT + Fw
to the field order). Furthermore, mixed polar coded MLC (1)
= HXT + WT
scheme is also provided, where both nonbinary polar codes
and binary polar codes are used as component codes, to realize where F and FH denote the unitary DFT matrix and IDFT
the trade off between the decoding latency and complexity. matrix of size Ms , respectively, h and H represent the channel
matrix of size Ns ×Ns in time-domain and frequency-domain,
II. S YSTEM M ODEL respectively, wi ∈ w ∼ CN (0, σn2 ) is an independent and
As an attractive technology against multipath fading, orthog- identically distributed complex Gaussian random variable in
onal frequency division multiplexing (OFDM) is considered time-domain with zero mean and variance N0 /2 per di-
for high mobility scenarios, in which both multipath effect and mension, and W is frequency-domain noise, exhibiting the
Doppler effect exist. The polar coded OFDM system model same statistical characteristics as the time-domain noise w.
under consideration is depicted in Fig. 1, where multilevel A linear minimum mean square error (LMMSE) equalizer is
coding scheme is applied, and the total available bandwidth is employed to mitigate the inter carrier interference (ICI) caused
divided into Ms narrowband orthogonal subcarriers. Suppose by the Doppler effect. Suppose that no CSI is available at the
that only one antenna is available at the transmitter and the transmitter, but the receiver has perfect CSI. Then, the received
receiver, respectively. symbol on the i-th (1 ≤ i ≤ Ms ) subcarrier is obtained as,
A K-bit source sequence d is first fed into a v-bit CRC
Zi = Ui Hi Xi + Ui Wi ,
encoder, resulting in a binary sequence u of length K + v.
Then, the sequence is partitioned into I sequences, i.e., u = where Ui = H H H +σ2 HiH represents the equalizer coefficient, 1
i i n
(u(1) , u(2)∑ , . . . , u(I) ). Let Ki denote the length of sequence and Hi denotes the i-th row of frequency-domain H. With the
(i) I
u with i=1 Ki = K +v, where the value of Ki is decided use of equalization, the equivalent noise of the received i-th
2
by the code construction. Each data sequence u(i) is encoded symbol becomes σn
2 . Consider the SCL-decoder with
(i) ∥Hi ∥2 +σn
by an individual polar encoder, producing a codeword c = list size L for each coding level, the i-th (1 ≤ i ≤ I) decoder
(i) (i) (i)
(c1 , c2 , . . . , cni ) (1 ≤ i ≤ I) of the component code Ci . works under the assumption that all codes in i′ -th (i′ < i)
Let GF(q) be a finite field with q = 2r , where r is a positive levels are decoded.
integer greater than unity. Denote by α a primitive element of
GF(q), then each element αi ∈ GF(q) can be formed as a r-bit III. M ULTIPLICATIVE R EPETITION -BASED N ONBINARY
vector. Let q-ary polar codes be used as the component codes. P OLAR C ODES
Note that the value of q can be different for each component A. Encoding
code, and if q = 2, the component codes are binary polar View the polar encoding as a repetition-superposition pro-
codes. Assume that the qi = 2ri -ary polar code be applied as cessing of information bits, then, by the multiplicative rep-
the i-th (1 ≤ i ≤ I) component code in i-th coding level. For etition method, we extend binary polar codes to q-ary polar
simplicity, equal code length n of each encoder is considered codes with the 2 × 2 q-ary kernel
in this paper, then the equivalent code length is Ni = ri n bits. [ ]
The total code rate is R = ∑K+v I
N
= ∑K+v I
r n
. F =
1 0
,
q
Suppose that a two-dimensional signal∑constellation X of
i=1 i i=1 i
αi 1
I
size |X | = 2m is employed, where m = i=1 ri . The coded where 0, 1, and αi ̸= 0 are field elements over GF(q). We call
(i)
symbols cj = {cj , 1 ≤ i ≤ I} at time j (1 ≤ j ≤ n) αi as multiplicative factor, which is different for each nested
∑I
are mapped into a sequence of Ns = i=1 ri n/m = n transmission and is known to both the encoder and the decoder.
Assume that αit represent the multiplicative factor for the t-th 1 1
C1 C
nested transmission, then, the generator matrix with the code 0.9 C 0.9 C
1

length n = 2t can be given as

2 2
0.8 C 0.8 C
[ ]
3 3
C C4

Capacity C (bits/symbol)

Capacity C (bits/symbol)
⊗(t−1) 0.7 4 0.7

⊗t Fq 0 C5
Gn = Bn Fq = Bn ⊗(t−1) ⊗(t−1) , t ≥ 2, 0.6 0.6
C6
α i t Fq Fq 0.5 0.5

0.4 0.4
where Bn is a permutation matrix for bit-reversal operation, 0.3 0.3
and αij is randomly chosen from nonzero elements of GF(q). 0.2 0.2
Note that G2 = Fq . 0.1 0.1

With the generator matrix and SC-based decoding methods, 0 0

−5 0 5 10 15 20 −5 0 5 10 15 20
the equivalent symbol-channels will polarize to be nearly Es/N0 (dB) Es/N0 (dB)

noiseless or useless. Note that the polarization exists only

Fig. 2: Capacity of each equivalent subchannel for 16-QAM
among the nonbinary symbols. In order to introduce the po-
and 64-QAM.
larization for bit-channels, an extra binary polarization matrix
Mr is applied to each coded symbol c′ resulting in a q-ary
symbol c = c′ Mr , the process of which can also be regarded Denote ci1 = {c1 , . . . , ci } (1 ≤ i ≤ m). Then, the mutual
as a symbol mapping. information of the equivalent subchannel i can be calculated
B. Decoding as
Due to the similar structure to binary polar codes, similar I(c(i) ; Y |ci−1
1 ) = I(ci ; Y |c1 ) − I(ci+1 ; Y |c1 ).
m i−1 m i
(5)
SC-based decoding methods can be used to MR-based q-ary Thus, the corresponding capacity of each equivalent subchan-
polar codes. Let p(y|β), β ∈ GF(q), represent the channel nel can be obtained by
conditional probabilities given by the demapper. The decoding ∫
1 ∑ PY |X (y|ci1 )
recursive formulas for the code length n can be given as Ci = PY |X (y|cm
1 ) log dy (6)
|X | PY |X (y|ci−1
1 )
1 ∈{0,1}
cm
(2i−1) Λ m
pλ (y1 , u2i−2
1 |u2i−1 ) y∈Y

∑1 (i) Λ/2 where PY |X denotes the channel transition probability with

= {pλ−1 (y1 1,odd ⊕ α
, u2i−2 u1,even |u2i−1 ⊕ αit u2i )
it+1 2i−2
input X and output Y . Fig. 2 shows the capacity of each
u2i
q
subchannel for 16-QAM and 64-QAM. It can be seen that
(i)
· pλ−1 (yΛ/2+1
Λ
1,even |u2i )},
, u2i−2 each subchannel exhibits distinctly different capacities, where
(2) the capacity gap between subchannels can be viewed as
(2i)
pλ (y1Λ , u2i−1
1 |u2i ) the modulation polarization. With the increase of modulation
1 (i) Λ/2 order, the number of coding levels is increased, resulting in
= pλ−1 (y1 , u2i−21,odd ⊕ α u1,even |u2i−1 ⊕ αit u2i ) (3)
it+1 2i−2
q high latency. Due to the fact that the multiple bits in nonbinary
(i)
· pλ−1 (yΛ/2+1 codes can be decoded as a symbol simultaneously, thus the
1,even |u2i ),
, u2i−2
Λ
MLC scheme with nonbinary codes as component codes can
where 1 ≤ λ ≤ log2 n, 1 ≤ 2i − 1 ≤ λ, Λ = 2λ , t = be considered for low latency by decreasing the number of
(1)
log2 n − λ + 1 and p0 (y|u) = p(y|u). coding levels.
The SC decoding can be extended to SCL decoding, where Now we focus on the nonbinary polar coded MLC scheme.
L paths are reserved at each decoding tree level. It is known that the essential point for the design of binary
coded MLC schemes is the assignment of code rates to the
IV. D ESIGN OF N ONBINARY P OLAR C ODED MLC S CHEME individual coding levels [15] according to the subchannel-
WITH L OW L ATENCY FOR H IGH M OBILITY S CENARIOS capacities, which can be regarded as the code polarization
Consider binary coded MLC scheme with m coding levels (due to the different code rates) combining with modulation
first. Let f (·) represent the signal mapping function. Then, the polarization. Similarly, the polarization matrix Mr , introduced
modulated symbol is given by x = f (c) = f (c(1) , . . . , c(m) ), in Section III for MR-based nonbinary polar codes, can also
where the Ungerboeck’s set partition labeling is used. Let X, Y be designed according to the corresponding r subchannel-
be random variables corresponding to their lowercase versions. capacities to intensify the polarization. By the polarization
Since there is a one-to-one correspondence between the X and matrix Mr , the r equivalent bit-channels within a symbol-
c(1) , . . . , c(m) , the MLC channel can be equivalently converted channel exhibit different reliabilities, which suggests that the
into m parallel equivalent subchannels from the chain rule of bit-channel with high reliability should correspond to the
mutual information, i.e., subchannel with high capacity. For example, consider the
polarization matrix has maximum polarization rate among the
I(X; Y ) = I(c(1) , . . . , c(m) ; Y )
matrices of the same size introduced in [9]. The polarization
= I(c(1) ; Y ) + I(c(2) ; Y |c(1) ) + . . . (4) matrix [0 0 1]
+ I(c (m)
; Y |c
(1)
,...,c (m−1)
). M2 = [ 01 11 ] , M3 = 0 1 1
110
 u(1) q-ary Encoder c(1) 2m-ary/2m-r-ary 0
10
for C
C1
11 Signal Set

u( 2) Binary Encoder c( 2 ) 2m-r-ary/2m-r-1-ary −1

10
u Partition for C
C1
21 Signal Set

...

...
−2
10

u( I ) c( I )

FER
Binary Encoder 2-ary X
for C
C1
I1 Signal Set −3
10

Fig. 3: System model of mixed polar coded MLC scheme. −4

10 Polar Coded BICM, L=32
Binary Polar Coded MLC, I=4, L=16
Nonbinary Polar Coded MLC, I=2, L=16
Mixed Polar Coded MLC, I=2, L=16
can be applied to 4-ary and 8-ary polar coded MLC scheme, ary 2 2.5 3
E /N (dB)
3.5 4
Set Partition b 0
respectively, where the arbitrary i-th and j-th (i < j) bit-
channel correspond to the i′ -th and j ′ -th subchannel with (a) 16-QAM
Ci′ > Cj ′ for the 16-QAM and 64-QAM with the capacity 0
10

shown in Fig. 2.
It is known that the decoding complexity will be increased −1
10

with increasing the field order. Considering the trade-off

between complexity and latency, a mixed polar coded ML- −2
10

C scheme is provided, where only one level uses a q-ary

FER
polar code as the component code. Refer to Fig. 3, where −3
10

I = m − r + 1.
V. N UMERICAL R ESULTS
In this section, numerical results are presented to evaluate
the performance of the nonbinary polar coded MLC scheme
over both the AWGN and HST channels.
Example 1: Consider q-ary polar coded MLC with 2m -
ary modulations over the AWGN channel. Rate-1/2 codes
with two modulation schemes 16-QAM and 64-QAM are
simulated. In Fig. 4(a), two MLC schemes with I = 2
are provided for 16-QAM. For nonbinary polar coded MLC
scheme, all component codes are 4-ary polar codes, while for
the mixed scheme, the first component code is an 8-ary polar
code. All component codes with n = 512 are constructed
by Monte-Carlo method at 4.5 dB. In Fig. 4(b), also two
schemes with nonbinary polar codes are considered for 64-
QAM. For nonbinary polar coded MLC scheme with I = 2,
all component codes are 8-ary polar codes, and for the mixed
scheme with I = 4, the first component code is also an 8-ary
polar code. All component codes with n = 512 are constructed
by Monte-Carlo method at 6.0 dB. The 16-bit CRC-aided SCL
decoding method is applied to all schemes.
For reference, the performance of comparable binary polar
coded BICM scheme and MLC scheme are also given in Fig.
4, where the codes are constructed by Monte-Carlo method
at the aforementioned design-SNRs. For the BICM-based
scheme, the bit-interleaver designed in [18] is applied, and
the quasi-uniform puncturing (QUP) method in [22] is used
to adapt the code length. The SP labeling is used to the MLC-
based scheme, and Gray labeling is applied to BICM-based
schemes.
From Fig. 4, it can be seen that MLC scheme outperform
BICM scheme with a smaller list size, resulting in lower
latency. Furthermore, nonbinary polar coded MLC scheme
exhibit better performance than binary polar coded MLC
scheme with a less coding levels. Due to the increased field
−4
10 Binary Polar Coded BICM, L=32
Binary Polar Coded MLC, I=6, L=8
Nonbinary Polar Coded MLC, I=2, L=8
Mixed Polar Coded MLC, I=4, L=8
5 5.25 5.5 5.75
E /N (dB)
6 6.25 6.5
b 0
(b) 64-QAM
Fig. 4: Performance comparison between nonbinary polar
coded MLC and binary polar coded scheme.
order for the first component code, the mixed scheme can
achieve better FER than nonbinary polar coded MLC scheme
for 16-QAM. The results also show that with the increase of
the field order, the coding gain can be increased.
Example 2: Consider q-ary polar coded MLC with 2m -ary
modulations over the HST channel. The OFDM system with
Ms = 512 subcarriers is considered for the HST channel,
where Ltap = 8 < Lcp = 10. The carrier frequency is 2.0
GHz, and sampling frequency is 15.36 MHz referring to the
LTE standard. The terminal speeds 120 km/h, 360 km/h and
500 km/h correspond to the Doppler spreads 222.2 Hz, 666.6
Hz, and 925.8 Hz, respectively.
Rate-1/2 codes with two modulation schemes 16-QAM and
64-QAM are simulated. In Fig. 4(a), the nonbinary polar coded
MLC scheme with I = 2 are constructed by Monte-Carlo
method at 6.0 dB for 16-QAM, in which the two component
codes are 4-ary polar codes with n = 256. In Fig. 4(b),
the nonbinary polar coded MLC scheme with I = 2 are
constructed by Monte-Carlo method at 8.0 dB for 64-QAM,
in which the two component codes are 8-ary polar codes with
n = 128. The CRC-aided SCL decoding are applied to all
codes with L = 16. The 8-bit CRC and 16-bit CRC are applied
to MLC scheme with 16-QAM and 64-QAM, respectively.
For comparison, the performance of comparable binary po-
lar coded BICM scheme and LTE turbo coded BICM scheme
 0
10
ACKNOWLEDGMENT
Polar Coded MLC with 120km/h
Polar Coded MLC with 360km/h
Polar Coded MLC with 500km/h
This work was supported in part by the National Natural
Polar Coded BICM with 120km/h
Polar Coded BICM with 360km/h
Science Foundation of China under Grants 61771364 and
−1
10
Polar Coded BICM with 500km/h 61701368.
LTE Turbo with 120km/h
LTE Turbo with 240km/h
LTE Turbo with 360km/h R EFERENCES
FER

−2
[1] D. Feng, Q. Li, B. Bai, and X. Ma, “Gallager mapping based con-
10
stellation shaping for LDPC-coded modulation systems,” in Proc. Int.
Workshop on High Mobility Wireless Commun., pp. 116-120, Oct. 2015.
[2] L. Wang, Y. Zhang, and X. Ma, “Block Markov superposition trans-
mission for high-speed railway wireless communication systems,” in
−3
10
3 5 7 9 11 13 15 Proc. Int. Workshop on High Mobility Wireless Commun., pp. 61-65,
E /N (dB)
b 0 Oct. 2015.
[3] E. Arıkan, “Channel polarization: A method for constructing capacity
(a) 16-QAM achieving codes for symmetric binary-input memoryless channels,” IEEE
0
Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
10
Polar Coded MLC with 120km/h [4] I. Tal and A. Vardy, “List decoding of polar codes,” in Proc. IEEE Int.
Polar Coded MLC with 360km/h Symp. Inf. Theory, pp. 1-5, Aug. 2011.
Polar Coded MLC with 500km/h
Polar Coded BICM with 120km/h [5] K. Chen, K. Niu, and J. R. Lin, “List successive cancellation decoding
Polar Coded BICM with 360km/h of polar codes,” Electronics Lett., vol. 48, no. 9, pp. 500-501, Apr. 2012.
−1 Polar Coded BICM with 500km/h
10
LTE Turbo with 120km/h [6] T. Wang, D. M. Qu, and T. Jiang, “Parity-check-concatenated polar
LTE Turbo with 240km/h codes,” IEEE Commun. Lett., vol.20, no.12, pp. 2342-2345, Sep. 2016.
LTE Turbo with 360km/h
FER

−2
10
−3
10
5 7 9 11 13 15
E /N (dB)
b 0
(b) 64-QAM
Fig. 5: Performance comparison among nonbinary polar coded
MLC with L = 16, binary polar coded BICM with L = 32,
and turbo coded scheme with 8 iterations.
are also given in Fig. 5. The binary polar codes are constructed
by Monte-Carlo method at aforementioned design-SNRs. The
CRC-aided SCL decoding are also applied to binary polar
codes, while L = 32. The Max-Log-Map decoding algorithm
with 8 iterations is applied to turbo codes.
From Fig. 5, we can see that nonbinary polar coded MLC
scheme performs better than LTE turbo codes with high-order
modulations over HST channels. Furthermore, compared with
binary polar coded BICM scheme, nonbinary polar coded
MLC scheme can achieve similar performance but with a
smaller list size, which resulting in low latency.
VI. C ONCLUSION
In this paper, we first introduced a new kind of nonbinary
polar codes based on multiplicative repetition method. With
the use of bandwidth-efficient MLC scheme, we then em-
ployed the proposed codes as component codes, and optimized
the design for high mobility scenarios with low latency. Con-
sidering the trade-off between the decoding latency and com-
plexity, mixed polar coded MLC scheme were also proposed.
Simulation results show that nonbinary polar coded MLC
scheme (with less coding levels) outperform LTE turbo coded
scheme, and can exhibit similar performance to binary polar
coded BICM scheme but with a smaller list size (reflecting
low latency) over HST channels.
[7] P. Chen, M. Xu, B. Bai, and J. Wang, “Design and performance of polar
codes for 5G communication under high mobility scenarios,” in Proc.
IEEE Veh. Technol. Conf., pp. 1-5, Jun. 2017.
[8] S. Korada, E. Şaşoǧlu and R. Urbanke, “Polar codes: Characterization
of exponent, bounds, and constructions,” IEEE Trans. Inf. Theory, vol.
56, no. 12, pp. 6253-6264, Dec. 2010.
[9] H. P. Lin, S. Lin, and K. A. S. Abdel-Ghaffar, “Linear and nonlinear
17 19 21
binary kernels of polar codes of small dimensions with maximum
exponents,” IEEE Trans. Inf. Theory, vol. 61, no. 10, pp. 5253-5270,
Aug. 2015.
[10] E. Şaşoǧlu, E. Telatar, and E. Arıkan, “Polarization for arbitrary discrete
memoryless channels,” in Proc. IEEE Inf. Theory Workshop, pp. 144-
148, Oct. 2009.
[11] M. Chiu, “Non-binary polar codes with channel symbol permutation-
s,” in Proc. IEEE Int. Symp. Inf. Theory & Its Applications, pp. 433-437,
Oct. 2014.
[12] R. Mori, and T. Tanaka, “Non-binary polar codes using Reed-Solomon
codes and algebraic geometry codes,” in Proc. IEEE Inf. Theory Work-
shop, pp. 1-5, Sep. 2010.
[13] N. Cheng, R. Zhang, and Y. Ge et al., “Encoder and list decoder of Reed-
Solomon kernel based polar codes,” in Proc. IEEE Int. Conf. Wireless
Commun. & Signal Process., pp. 1-6, Oct. 2016.
[14] D. M. Shin, S. C. Lim, and K. Yang, “Mapping selection and code
construction for 2m -ary polar-coded modulation,” IEEE Commun. Lett.,
vol. 16, no. 6, pp. 905-908, Apr. 2012.
[15] M. Seidl, A. Schenk, C. Stierstorfer, and J. Huber, “Polar-coded modu-
lation,” IEEE Trans. Commun., vol.61, no.10, pp. 4108-4119, Oct. 2013.
[16] K. Chen, K. Niu and J. Lin, “Polar coded modulation with optimal
constellation labeling,” in Proc. IET National Doctoral Academic Forum
on Inf. and Commun. Technology, pp. 1-5, Aug. 2013.
[17] K. Chen, K. Niu and J. Lin, “An efficient design of bit-interleaved
polar coded modulation,” in Proc. IEEE Int. Symp. Personal Indoor and
Mobile Radio Commun., pp. 693-697, Sep. 2013.
[18] P. Chen, M. Xu, B. Bai, and X. Ma, “Design of polar coded 64-QAM,” in
Proc. IEEE Int. Symp. on Turbo Codes & Iterative Inf. Process., pp.
251-255, Sep. 2016.
[19] S. Liu, Y. Hong, and E. Viterbo, “Adaptive polar coding with high
order modulation for block fading channels,” in Proc. IEEE Int. Conf.
Commun. Workshops, pp. 1-6, May. 2017.
[20] T. K. Akino, Y. Wang, S. C. Draper, K. Sugihara, and W. Matsumoto,
“Bit-interleaved polar-coded OFDM for low-latency M2M wireless
communications,” in Proc. IEEE Int. Conf. Commun., pp. 1-7, May.
2017.
[21] A. Ghazal, C. Wang, and B. Ai et al.,“A nonstationary wideband
MIMO channel model for high-mobility intelligent transportation sys-
tems,” IEEE Trans. Intelligent Transportation Systems, vol. 16, no. 2,
pp. 885-897, Sep. 2015.
[22] K. Niu, K. Chen, and J. R. Lin, “Beyond turbo codes: Rate-compatible
punctured polar codes,” in Proc. IEEE Int. Conf. Commun., pp. 3423-
3427, Nov. 2013.