Page 73 - 《应用声学》2022年第1期

第 41 卷 第 1 期 胡承昊等： 基于 Polar 码的水声通信信源信道联合译码方法 69

[11] Guivarch L, Carlach J C, Siohan P. Joint source- [18] Niu K, Chen K. CRC-aided decoding of polar codes[J].
channel soft decoding of Huffman codes with turbo- IEEE Communications Letters, 2012, 16(10): 1668–1671.
codes[C]//Proceedings DCC 2000. Data Compression [19] Tal I, Vardy A. List decoding of polar codes[J].
Conference, Snowbird, UT, USA, 2000: 83–92. IEEE Transactions on Information Theory, 2015, 61(5):
[12] 陈绍宏, 张灿, 凃国防, 等. 基于变长 Turbo 码的低复杂度联 2213–2226.
合信源信道译码 [J]. 中国科学院研究生院学报, 2011, 28(2): [20] Eslami A, Pishro-Nik H. On finite-length performance of
246–252. polar codes: stopping sets, error floor, and concatenated
Chen Shaohong, Zhang Can, Tu Guofang, et al. Low- design[J]. IEEE Transactions on Communications, 2013,
complexity joint source-channel decoding based on vari-
61(3): 919–929.
able length encoded Turbo codes[J]. Journal of the Grad-
[21] Meng Y, Fang Y, Zhang C, et al. LLR processing of po-
uate School of the Chinese Academy of Sciences, 2011,
lar codes in concatenation systems[J]. China Communica-
28(2): 246–252.
tions, 2019, 16(9): 201–208.
[13] Lakovic K, Tian T, Villasenor J. Iterative decoder design
[22] Wang Y, Qin M, Narayanan K R, et al. Joint source-
for joint source-channel LDPC coding[C]//EUROCON
channel decoding of polar codes for language-based
2005-The International Conference on “Computer as a
sources[C]//2016 IEEE Global Communications Confer-
Tool”, Belgrade, Serbia, 2005: 486–489.
ence, Washington, DC, 2016: 1–6.
[14] Mei Z, Wu L. Joint source-channel decoding of Huffman
[23] Tal I, Vardy A. How to construct polar codes [J].
codes with LDPC codes[J]. Journal of Electronics (China),
IEEE Transactions on Information Theory, 2013, 59(10):
2006, 23(6): 806–809.
6562–6582.
[15] 王粤, 余松煜, 张彦昕, 等. 一种新的信源信道联合迭代解
码 [J]. 上海交通大学学报, 2006, 40(9): 1487–1491. [24] Trifonov P. Efficient design and decoding of polar codes[J].
Wang Yue, Yu Songyu, Zhang Yanxin, et al. A new joint IEEE Transactions on Communications, 2012, 60(11):
source channel iterative decoder[J]. Journal of Shanghai 3221–3227.
Jiaotong University, 2006, 40(9): 1487–1491. [25] Balatsoukas-Stimming A, Parizi M B, Burg A. LLR-based
[16] Arikan E. Channel polarization: a method for construct- successive cancellation list decoding of polar codes[J].
ing capacity-achieving codes for symmetric binary-input IEEE Transactions on Signal Processing, 2015, 63(19):
memoryless channels[J]. IEEE Transactions on Informa- 5165–5179.
tion Theory, 2009, 55(7): 3051–3073. [26] Hu X Y, Eleftheriou E, Arnold D M. Progressive edge-
[17] Arikan E, Telatar E. On the rate of channel polariza- growth Tanner graphs[C]//GLOBECO’01. IEEE Global
tion[C]//2009 IEEE International Symposium on Infor- Telecommunications Conference (Cat. No. 01CH37270)
mation Theory, Seoul, Korea (South), 2009: 1493–1495. IEEE, 2001, 2: 955–1001.