2810
9, SEPTEMBER 2021
Joint Source and Channel Coding Using Double Polar Codes
Yanfei Dong , Kai Niu , Member, IEEE, Jincheng Dai , Member, IEEE, Sen Wang, and Yifei Yuan
Abstract— In this letter, a double polar code (D-Polar) for joint
source and channel coding (JSCC) is proposed, in which the
source compress is implemented by a polar code, the channel
error correction is performed by a systematic polar code.
Furthermore, a turbo-like belief propagation (TL-BP) decoder
consisted of a channel BP decoder and a source BP decoder is
proposed for joint source and channel decoding in the receiver. In
this TL-BP decoder, the soft information is exchanged between
the channel BP decoder and the source BP decoder so as to
improve the efficiency of channel decoding in utilizing the source
information residual in the compressed bits. Simulation results
show that the performance of the proposed D-Polar JSCC scheme
with TL-BP decoder is significantly improved compared with the
existing source-channel joint polarization scheme.
Index Terms— Joint source and channel coding, double polar
codes, turbo-like belief propagation decoder.
I. I NTRODUCTION
T HE source-channel separation theorem [1] indicates that
the same rate can be achieved for both separated source-
channel coding (SSCC) and joint source-channel coding
(JSCC), assuming that latency, complexity, and code length
are not constrained. In fact, a joint source-channel decoder
that considers the source statistics in channel decoding is pos-
sible to achieve a performance gain in practical transmission
systems where the delay, complexity, and code length are
limited. One of the main approaches of JSCC is the joint
exploitation of the graphical model structure of the source
and the channel code. Universal source codes (e.g., Lempel-
Ziv or arithmetic codes) are not well matched with the fixed-
to-fixed length channel codes (e.g., low-density parity-check
(LDPC) codes or Polar codes) to constitute a joint graphical
model structure. To tackle this, double low-density parity-
check (D-LDPC) codes is advocated [2], [3]. In the D-LDPC
codes scheme, one LDPC code is utilized to compress the
source instead of the universal source codes, and the other
LDPC code is used to against channel errors. The double
protograph LDPC (DP-LDPC) codes scheme is a variant of
D-LDPC by replacing the regular or irregular LDPC code with
the protograph LDPC code [4]–[6].
Polar codes, proposed by Arıkan [7] based on the phe-
nomenon of channel polariztion, provably achieve the capac-
Manuscript received April 6, 2021; revised May 11, 2021; accepted
June 6, 2021. Date of publication June 14, 2021; date of current version
September 10, 2021. This work was supported by the National Key R&D Pro-
gram of China (No. 2018YFE0205501), National Natural Science Foundation
of China (No. 62001049 & No. 62071058), and Beijing University of Posts
and Telecommunications - China Mobile Research Institute Joint Innovation
Center. The associate editor coordinating the review of this letter and approv-
ing it for publication was M.-R. Sadeghi. (Corresponding author: Kai Niu.)
The authors are with the Key Laboratory of Universal Wireless Communi-
cations, Ministry of Education, Beijing University of Posts and Telecommu-
nications, Beijing 100876, China (e-mail: niukai@bupt.edu.cn).
Digital Object Identifier 10.1109/LCOMM.2021.3088941
1558-2558 © 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.
Authorized licensed use limited to: ANURAG GROUP OF INSTITUTIONS. Downloaded on February 15,2022 at 04:50:39 UTC from IEEE Xplore. Restrictions apply.
IEEE COMMUNICATIONS LETTERS, VOL. 25, NO.
ity of any symmetric binary-input discrete memoryless
channel (B-DMC) with the efficient encoding and decoding
algorithms. Polar codes have been well studied in the field of
channel coding [8]–[10]. For a joint source-channel decoding
(JSCD) problem, polar codes can effectively exploit the resid-
ual redundancy in the output of the source encoder [11], e.g.,
for language-based sources, polar list decoder can improve its
performance by judging the reliability of the decoded words
through a dictionary [12]. In the joint decoding scheme for
correlated sources, the use of systematic polar codes facilitates
decoders to exploit the correlation among the sources [13].
Since the polarization phenomenon also exists in the source,
polar codes are applied in the field of source coding, including
lossless source polar coding [14], [15] and lossy source polar
coding [16]. Considering joint source-channel polarization,
a quasi-uniform systematic polar code (qu-SPC) is proposed
for JSCC, whose construction process changes the regular
recursive structure in the generation matrix of the polar
code [17]. However, the source polar code is not directly used
in JSCC scheme, although it is efficient and low-complexity.
In this letter, we propose a new JSCC scheme with using
double polar (D-Polar) codes. Two concatenated polar codes
are used in the transmitter: one polar code for source coding
and the other systematic polar code for channel coding. Source
polarization is performed on the source sequence, and then
the high-entropy source bits are encoded into a systematic
polar code. The coding process of the D-Polar codes reserves
the regular recursive structure of the generation matrix.
A turbo-like belief propagation (TL-BP) decoder is used for
joint source and channel decoding in the receiver. In the
proposed TL-BP decoder, the BP algorithm is used for both
channel and source decoding. In an external iteration of the
TL-BP decoder, the channel BP decoder provides the soft
information of the compressed bits for the source BP decoder,
and the soft information of the systematic bits of channel polar
code generated by the source BP decoder is fed to the channel
BP decoder. Simulation results show that the proposed D-Polar
JSCC scheme with TL-BP decoder achieves 2.33 dB gain
with respect to the existing source-channel joint polarization
scheme, i.e., qu-SPC.
The remainder of this letter is organized as follows.
Section II presents the encoder structure of D-Polar codes
and the TL-BP decoder for the JSCD. Simulation results are
provided in Section III. Finally, Section IV concludes this
letter.
II. D OUBLE P OLAR C ODES FOR J OINT
S OURCE AND C HANNEL C ODING
In this section, we first propose a D-Polar code encoder for
JSCC. Then, the TL-BP decoder is proposed for joint source
and channel decoding.
DONG et al.: JSCC USING D-POLAR CODES 2811

Fig. 1. The encoder structure of D-Polar codes.

Fig. 3. The basic structure of an iterative TL-BP decoder.

where z1Ncc is an i.i.d Gaussian noise sequence and each

noise sample with zero mean and variance σ 2 . And the log-
likelihood ratio (LLR) of yi can be written as
2
L(yi ) = 2 yi . (5)
σ
B. Decoder Structure
Although successive cancellation list (SCL) algorithm
Fig. 2. An example of joint factor graph for D-Polar codes.
[9], [10] can achieve better performance than BP algorithm,
the BP algorithm is more suitable for soft iterative structures.
A. Encoder Structure For the systematic polar codes employed in the D-Polar
codes, the systematic bits are obtained by re-encoding the
Given an independent and identically distributed (i.i.d.) estimated information bits ŵA in the SCL decoder, where the
Bernoulli source U with a success probability p < 1/2, the re-encoding is done in the binary filed, which means that it
message from source U is denoted by the sequence uN 1
sc
= is not appropriate to obtain the soft information related to
m
(u1 , u2 , . . . , uNsc ), where Nsc = 2 is the message length. the systematic bits. For the source polar decoding, the high-
Fig. 1 shows the encoder structure of the proposed D-Polar entropy bits vF are equivalent to the frozen bits in the
codes. First, the source message is compressed by a polar code. conventional polar decoder. For the conventional SCL decoder,
The source polarization of the sequence uN 1
sc
is performed as the frozen bits is involved in the calculation of the partial
follows: sum in binary filed. The source SCL decoder cannot make
use of the soft information associated with the frozen bits.
v1Nsc = uN
1 G
sc ⊗m
, (1)
Therefore, we consider the BP algorithm to constitute the
10
where G⊗m is the m-order Kronecker power of G = 1 1 . JSCD framework, which is soft-input soft-output (SISO).
As shown in Fig. 3, an iteratively joint decoder, named
Let F denote the set of indices of the high-entropy bits in v1Nsc
TL-BP decoder, is proposed for the D-Polar codes, which
with Ksc = |F | [14]. The compressed bits are designated as
mainly composes of two SISO decoders, e.g., channel BP
vF = {vi |i ∈ F }. Then, we protect the compressed bits with
decoder and source BP decoder. The TL-BP decoder involves
a systematic polar code. Let A denote the set of the index of
two levels of iteration, internal and external. The channel
information bits in the channel polar code with Kcc = |A|.
BP decoder and source BP decoder each perform internal
We can split the codeword into two parts by writing xN 1
cc
=
n iterations independently, and the soft information interaction
(xB , xBc ), where Ncc = 2 is the codeword length, set B is
between them is referred to as an external iteration. The
equal to A and the systematic bits xB are assigned as to the
a priori information of the source can be fully exploited
compressed bits vF . Meanwhile, the parity bits are given by
by the TL-BP decoder benefiting from external iteration.
xBc = wA G⊗n ⊗n
ABc ⊕ wAc GAc Bc , (2) A brief description of the TL-BP decoding algorithm is given
in Algorithm 1. In the TL-BP decoder, the channel BP decoder
where wAc is an all-zero subvector, and G⊗n ABc denotes the is activated first, as shown in Lines 2-7 of Algorithm 1.
submatrix of G⊗n consisting of the array of elements (G⊗n i,j ) 1) Channel BP Decoding: Similar to the right half of Fig. 2,
with i ∈ A and j ∈ B c , and submatrix G⊗n
c
A B c can be similarly a channel polar code with code length Ncc can be represented
defined. The wA is calculated as follows as an factor graph with n + 1 stages and Ncc levels, i.e., the
channel BP decoder is performed on an n + 1 stages factor
wA = (xB − wAc G⊗n ⊗n −1
Ac B )(GAB ) . (3) graph, each stage containing Ncc nodes. The node of stage
1 ≤ j ≤ n + 1 and level 1 ≤ i ≤ Ncc in the t-th iteration
Fig. 2 shows an example of D-Polar coding for JSCC. t
The source sequence u41 is compressed into vF , where F = contains two kinds of message, message Ri,j propagated from
t
{1, 2, 3}. Then the compressed bits uF is assigned to system- right-to-left and message Li,j propagated from left-to-right.
t
atic bits xB , where B = {6, 7, 8}, and xBc can be calculated The initialization of the message Ri,j and Lti,j is shown at
by (2). The codeword x81 is the final encoding results of this Lines 2-4 of Algorithm 1. The channel BP decoder has a priori
example. information coming from the frozen set A. Therefore, the left
t
The codeword xN cc
is transmitted over a BI-AWGN chan- hand side message Ri,1 on the left side is initialized to
1 
nels. The signals received at the destination are given by +∞, if i ∈ A,
0
Ri,1 = (6)
y1Ncc = (1 − 2xN Ncc
1 ) + z1 ,
cc
(4) 0, otherwise.

Authorized licensed use limited to: ANURAG GROUP OF INSTITUTIONS. Downloaded on February 15,2022 at 04:50:39 UTC from IEEE Xplore. Restrictions apply.
2812 IEEE COMMUNICATIONS LETTERS, VOL. 25, NO. 9, SEPTEMBER 2021

Algorithm 1 TL-BP Decoding for D-Polar Codes 2) Source BP Decoding: In an external iteration, the source
Input: the received vector y1Ncc BP decoder is triggered after the termination of the internal
iteration of the channel BP decoder, as presented in Lines 9-13
Output: a decoded source sequence ûN 1
sc
of Algorithm 1. Similar to the left half of Fig. 2, the source
1 for t = 1, 2, . . . , T do
polar code with message length Nsc can also be represented
//Channel BP decoder
0 as a factor graph with m + 1 stages and Nsc levels, so the
2 Ri,1 ← +∞ for i ∈ A
source BP decoder is performed on a factor graph with m + 1
3 Li,n+1 ← L(yi ) + Lsa (yi ) for i ∈ B
0
stages, each stages consisting of Nsc nodes. For the sake of
4 L0i,n+1 ← L(yi ) for i ∈ B c distinction, in the t-th iteration, let li,jt t
and ri,j denote the
5 for tc = 1, 2, . . . , Tcc do messages propagating from left to right and from right to left
6 Update Lti,j and Ri,j t
based on (8) in the (i, j)-index node, respectively.
7 Apply early stopping criterion The initialization of the source BP decoder needs to be done
8 Lca (vF ) ← {Lti,n+1 |i ∈ B} before running, which is shown in Lines 9-10 of Algorithm 1.
//Source BP decoder Unlike the all-zero subvector wA , the compressed bits vF
9
0
ri,1 ← Lca (vi ) for i ∈ F are not fixed. The a priori information of vF , denoted by
10 li,m+1 ← ln 1−p
0 Lca (vF ), acts as the role of +∞ in (6), which is provided by
p
11 for ts = 1, 2, . . . , Tsc do the channel BP decoder in an external iteration. Therefore,
t
12
t
Update li,j and ri,jt
based on (13) the initialization of ri,1 is as follows
13 Apply early stopping criterion 
0 Lca (vi ), if i ∈ F,
14 Lsa (xB ) ← {ri,m+1
t
|i ∈ F } ri,1 = (11)
0, otherwise.
15 Obtain the source estimate ûN
1
sc
t
return the decoded source sequence ûN sc Meanwhile, in a conventional BP decoder, ri,1 is initialized
16 1 .
as the channel received LLR, but for the source polar code
used in this letter, the source sequence is not transmitted
through the channel, instead, the decoder knows the probability
In the standard BP decoder, the right hand side left- distribution of the source symbols. Suppose Pr(u = 1) = p
propagating message Lti,n+1 is initialized to channel received t
in the source, then the initialization of li,m+1 is given by
LLR L(yi ). However, in the TL-BP decoder, since the chan-
nel BP decoder knows the priori information Lsa (xi ) of the 0 Pr(u = 0) 1−p
li,m+1 = ln = ln (12)
systematic bit xB sent from the source BP decoder in the Pr(u = 1) p
last external iteration, the initialization of Lti,n+1 (Lines 3-4, t t
Algorithm 1) should be written as follows: The message inside all nodes, except ri,1 and li,m+1 ,
 is initialized to zero. Like the channel BP decoder, update
0 L(yi ) + Lsa (xi ), if i ∈ B, rules can be described as
Li,n+1 = (7) ⎧t
L(yi ), otherwise. t
li,j = f (ri+2 t t
⎪ j ,j + li+2j ,j+1 , li,j+1 )
⎪
⎪
⎨l t t t t
Other messages are initialized to 0 since no further a priori i+2j ,j = f (ri,j , li,j+1 ) + li+2j ,j+1
t t−1 t t
(13)
information is given. It should be noted that both messages ⎪
⎪ ri,j+1 = f (li+2 j ,j+1 + ri+2j ,j , ri,j )
Lti,n+1 and Ri,1 t
are not updated through the decoding. ⎪
⎩ t t−1 t t
ri+2j+1 ,j+1 = f (li,j+1 , ri,j ) + ri+2 j ,j
In t-th iteration, the channel BP decoder first updates Lti,j
serially in the order of j = n, n − 1, . . . , 1, and then serially Based on the above update rules, in the t-th iteration,
t
updates Ri,j in the order of j = 2, 3, . . . , n + 1. Update rules the decoder updates ri,jt
in the order j = 2, 3, . . . , m + 1
t
can be described as and then updates li,m+1 in the order j = m, m − 1, . . . , 1.
⎧ t t t t
⎪ Li,j = f (Ri+2 j ,j + Li+2j ,j+1 , Li,j+1 )
The maximum iteration number of the source BP decoder
⎪
⎪ is determined by a preset parameter Tsc . After the iteration
⎨L t t t t
i+2j ,j = f (Ri,j , Li,j+1 ) + Li+2j ,j+1 number t reaches Tsc , source BP decoding stops, at which
t−1 (8)
⎪ t t
⎪Ri,j+1 = f (Li+2j ,j+1 + Ri+2j ,j , Ri,j )
t
⎪
⎩ t point one external iteration ends. Same with (10), the posterior
Ri+2j+1 ,j+1 = f (Lt−1 t t
i,j+1 , Ri,j ) + Ri+2j ,j probability ratio in the logarithmic domain of vi is given by
where f (x, y) is as follows t t
Lp (vi ) = ri,m+1 + li,m+1 . (14)
x+y

1+e
f (x, y)  log . (9) 3) Soft Information Exchange: As shown in Fig. 3, in an
ex + ey external iteration, the channel BP decoder supplies the extrin-
After reaching a preset number of iterations Tcc , channel sic information of xB to the source BP decoder, and the
BP decoding terminates. we can get the posterior probability extrinsic information of vF from the source BP decoder is fed
ratio in the logarithmic domain of xi to the channel BP decoder. The required extrinsic information
is obtained by subtracting the external input information from
t
Lp (xi ) = Ri,n+1 + Lti,n+1 . (10) the posterior information. Based on (7) and (10), the extrinsic

Authorized licensed use limited to: ANURAG GROUP OF INSTITUTIONS. Downloaded on February 15,2022 at 04:50:39 UTC from IEEE Xplore. Restrictions apply.
DONG et al.: JSCC USING D-POLAR CODES
information associated with each systematic bit {xi |i ∈ B}
produced by channel BP decoder is given by
L(1) s
e (xi ) = Lp (xi ) − [L(yi ) + La (xi )]
t
= Ri,n+1 .
(1)
Then, the source decoder receives Le (xB ) as a pri-
ori information Lca (vi ) of the compressed bit {vi |i ∈ F }
(Line 8, Algorithm 1).
(2)
Let Le (vi ) denote the extrinsic information associated
with each compressed bit {vi |i ∈ F }. Likewise, for the source
BP decoder, we can obtain extrinsic information associated
with each compressed bit based on (11) and (14), as follows.
L(2) c
e (vi ) = Lp (vi ) − La (vi )
t
= ri,m+1
(2)
for i ∈ F. The extrinsic information Le (vF ) can be regarded
as a priori information of systematic bits. Therefore, the extrin-
(2)
sic information Le (vF ) as a priori information Lsa (xB ) is
fed to the channel BP decoder for the next external iteration
(Line 14, Algorithm 1).
4) Early Stopping Criterion and Hard-Decision: In order
to reduce the decoding complexity, the early stopping crite-
rion [18] is applied to the TL-BP decoder (Lines 7 and 13,
Algorithm 1). Let T denote the maximum number of external
iteration. After the source decoder early stopping criterion
holds or the number of external iterations reaches T , shown
in Line 15 of Algorithm 1, the source bits are estimated by
 and the TL-BP decoder, the proposed D-Polar codes is utilized
0, if Lp (ui ) ≥ 0,
ûi = (17)
1, if Lp (ui ) < 0.
where L(ui ) is the LLR of the source bit ui for i =
1, 2, . . . Nsc computed as
t t
Lp (ui ) = ri,1 + li,1 .
III. P ERFORMANCE E VALUATION
In this section, we evaluate the performance of the JSCC
scheme with D-Polar codes. The polar code used in the
simulations is constructed via Gaussian approximation [19].
The length of the source sequence is Nsc = 512. And the
overall rate is R = Nsc /Ncc = 1/2. The preset maximum
number of extrinsic iterations is T = 25, and the preset
maximum iteration number of channel or source BP decoder
is Tsc = Tcc = 40. We use AWGN channels and Bernoulli
sources. A Bernoulli source U with Pr(u = 1) = 0.07
is given. The maximum number of the simulated frames is
108 . The simulation stops when the number of error frames
reaches 100.
Fig. 4 provides the bit error rates (BER) performance com-
parison among the channel BP decoder, the separate double
BP decoder (SD-BP), the TL-BP decoder, the qu-SPC [17]
with cyclic redundancy check aided successive-cancellation
list (CA-SCL, L = 32) decoder (the length of CRC is 24 bits)
and the D-LDPC scheme [2]. For the channel BP decoders,
the transmitter employs (1024, 512) polar code directly, and
the source statistics is ignored during decoding. The SD-BP
decoder is a version of the TL-BP decoder that does not
Authorized licensed use limited to: ANURAG GROUP OF INSTITUTIONS. Downloaded on February 15,2022 at 04:50:39 UTC from IEEE Xplore. Restrictions apply.
2813
(15)
Fig. 4. BER comparsion of the channel BP decoder, the SD-BP decoder,
the TL-BP decoder, the qu-SPC [17] and the D-LDPC codes [2].
(16)
TABLE I
AVERAGE I TERATION N UMBER OF T WO C OMPONENT
D ECODERS IN THE TL-BP D ECODER
perform external iteration. Moreover, in the SD-BP decoder,
the hard-decision of soft message from the channel BP decoder
is fed to the source BP decoder. For both the SD-BP decoder
on the transmitter side. The source and channel coding rate
of the D-Polar codes and the D-LDPC codes is denoted by
(Rsc , Rcc ) = (3/5, 3/10). For a fair comparison, the maxi-
mum number of iterations for the channel BP decoder is set
to 2000 = (25×40)×2, and the maximum number of iterations
for the SD-BP decoder and the BP decoder of D-LDPC scheme
(18)
is set to 1000 = 25 × 40.
As shown in Fig. 4, the SD-BP decoder achieves 2.17 dB
performance gain at BER = 10−3 compared with the chan-
nel BP decoder. The coding gain comes purely from the
lower-rate channel encoder. And the TL-BP decoder achieves
3.63 dB performance gain at BER = 10−3 compared with
the channel BP decoder. The TL-BP decoder has 1.46 dB
gain over the SD-BP decoder due to the external iteration.
In the TL-BP decoder, as the number of external iterations
increases, the source BP decoder provides a more reliable
soft information to the channel decoder, improving the overall
performance. Compared with the D-LDPC codes [2] and the
qu-SPC [17], the D-Polar codes can obtain 0.46 dB and
2.33 dB gain at BER = 10−3 , respectively. Similar to the
D-Polar codes scheme, the D-LDPC codes scheme also has
error floor. The absence of error floor is an advantage of the
qu-SPC scheme.
Table I provides the average number of iterations of two
component decoders of the TL-BP decoder (i.e., the channel
BP decoder and the source BP decoder) when the G-matrix
criterion [18] is applied. The simulation results show that
the average number of iterations decreases sharply with the
increase of Eb/N0 for both source decoding and channel
decoding. When the Eb/N0 is equal to −1 dB, the average
2814
Fig. 5. BER comparison of the TL-BP decoder with Rsc = {3/5,
7/10, 3/4} and p = {0.07, 0.04, 0.02}.
Fig. 6. BER comparison of the D-Polar codes with the DP-LDPC
codes [4], [6].
number of iterations for the channel and source BP decoders
are 15.56 and 11.67, respectively.
The error floor of the D-Polar codes is due to residual
decoding errors introduced by source code. The proposed
D-Polar codes has a design parameter, Rsc , which can be
used to trade-off the coding gain and the error floor. As the
parameter Rsc increases, the coding gain decreases and the
error floor is lower. To illustrate this point, we show the effect
of different Rsc on the our proposed D-Polar JSCC scheme
in Fig. 5. When Rsc = 7/10, the error floor reaches 10−5 ,
and when Rsc = 3/4, the error floor reaches 10−6 . The
reduction in error floor comes at the cost of performance
loss. At BER = 10−3 , the performance losses of Rsc =
7/10 and Rsc = 3/4 compared to Rsc = 3/5 are 0.4 dB
and 0.76 dB, respectively. In addition, we also provide the
influence of different source statistics on the proposed JSCC
system. As shown in Fig. 6, the lower the entropy is, the better
the BER performance is. The gains that can be obtained for
p = 0.04 and p = 0.02 compared to p = 0.07 are 0.69 dB
and 1.04 dB at BER = 10−3 , respectively.
Furthermore, we provide a comparison of the DP-LDPC
JSCC scheme and the D-Polar JSCC scheme under short codes
in Fig. 6. For facilitate comparison with [4], [6], we change
Nsc to 1024 and the overall code rate to 1, where Rsc and Rcc
are both 1/2. At BER = 10−2 , the D-Polar codes has 0.5 dB
gain compared to [4] but there is still a 1 dB performance gap
Authorized licensed use limited to: ANURAG GROUP OF INSTITUTIONS. Downloaded on February 15,2022 at 04:50:39 UTC from IEEE Xplore. Restrictions apply.
IEEE COMMUNICATIONS LETTERS, VOL. 25, NO. 9, SEPTEMBER 2021
with the DP-LDPC [6] optimized based on the differential
evolution algorithm.
IV. C ONCLUSION
This letter proposed a D-Polar code for JSCC. The proposed
D-Polar code consists of a source polar code and a channel
systematic polar code. The source polar coding is directly
applied in the proposed D-Polar codes scheme. Meanwhile,
the soft iterative structure of the TL-BP decoder allows the
channel decoder to take full advantage of the residual source
information in the compressed bits. Simulation results indicate
that the D-Polar codes achieves 2.33 dB performance gain
under the TL-BP decoder compared with the existing source-
channel joint polarization scheme, i.e., qu-SPC. Theoretical
analysis of error floor and construction of soft iterative SCL
algorithms applicable to D-Polar codes are future works to be
addressed.
R EFERENCES
[1] C. E. Shannon, “A mathematical theory of communication,” Bell Syst.
Tech. J., vol. 27, no. 3, pp. 379–423, 1948.
[2] M. Fresia, F. Perez-Cruz, and H. V. Poor, “Optimized concatenated
LDPC codes for joint source-channel coding,” in Proc. IEEE Int. Symp.
Inf. Theory (ISIT), Jun. 2009, pp. 2131–2135.
[3] M. Fresia, F. Perez-Cruz, H. V. Poor, and S. Verdu, “Joint source
and channel coding,” IEEE Signal Process. Mag., vol. 27, no. 6,
pp. 104–113, Nov. 2010.
[4] Q. Chen, L. Wang, S. Hong, and Y. Chen, “Integrated design of
JSCC scheme based on double protograph LDPC codes system,” IEEE
Commun. Lett., vol. 23, no. 2, pp. 218–221, Feb. 2019.
[5] S. Liu, C. Chen, L. Wang, and S. Hong, “Edge connection optimization
for JSCC system based on DP-LDPC codes,” IEEE Wireless Commun.
Lett., vol. 8, no. 4, pp. 996–999, Aug. 2019.
[6] S. Liu, L. Wang, J. Chen, and S. Hong, “Joint component design for
the JSCC system based on DP-LDPC codes,” IEEE Trans. Commun.,
vol. 68, no. 9, pp. 5808–5818, Sep. 2020.
[7] E. Arıkan, “Channel polarization: A method for constructing capacity-
achieving codes for symmetric binary-input memoryless channels,” IEEE
Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.
[8] I. Tal and A. Vardy, “How to construct polar codes,” IEEE Trans. Inf.
Theory, vol. 59, no. 10, pp. 6562–6582, Oct. 2013.
[9] K. Niu and K. Chen, “CRC-aided decoding of polar codes,” IEEE
Commun. Lett., vol. 16, no. 10, pp. 1668–1671, Oct. 2012.
[10] I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inf.
Theory, vol. 61, no. 5, pp. 2213–2226, May 2015.
[11] Y. Wang, K. R. Narayanan, and A. A. Jiang, “Exploiting source
redundancy to improve the rate of polar codes,” in Proc. IEEE Int. Symp.
Inf. Theory (ISIT), Jun. 2017, pp. 864–868.
[12] Y. Wang, M. Qin, K. R. Narayanan, A. Jiang, and Z. Bandic, “Joint
source-channel decoding of polar codes for language-based sources,” in
Proc. IEEE Global Commun. Conf., Dec. 2016, pp. 1–6.
[13] L. Jin, P. Yang, and H. Yang, “Distributed joint source-channel decoding
using systematic polar codes,” IEEE Commun. Lett., vol. 22, no. 1,
pp. 49–52, Jan. 2018.
[14] E. Arikan, “Source polarization,” in Proc. IEEE Int. Symp. Inf. Theory
(ISIT), Jun. 2010, pp. 899–903.
[15] H. S. Cronie and S. B. Korada, “Lossless source coding with polar
codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2010,
pp. 904–908.
[16] S. B. Korada and R. Urbanke, “Polar codes are optimal for lossy
source coding,” in Proc. IEEE Inf. Theory Workshop (ITW), Oct. 2009,
pp. 149–153.
[17] L. Jin and H. Yang, “Joint source-channel polarization with side infor-
mation,” IEEE Access, vol. 6, pp. 7340–7349, 2018.
[18] B. Yuan and K. K. Parhi, “Early stopping criteria for energy-efficient
low-latency belief-propagation polar code decoders,” IEEE Trans. Signal
Process., vol. 62, no. 24, pp. 6496–6506, Dec. 2014.
[19] P. Trifonov, “Efficient design and decoding of polar codes,” IEEE Trans.
Commun., vol. 60, no. 11, pp. 3221–3227, Nov. 2012.