瑞利衰落信道中SC-LDPC码滑窗译码算法

doi:10.19665/j.issn1001-2400.2020.06.012

Abstract

Abstract:

A recent research hot spot, the sliding window decoding (SWD) of spatially coupled low density parity check (SC-LDPC) codes has the advantages of low decoding latency, low complexity, and small memory requirements. But at present, most of the current research work is focused on Gaussian channels. Over the Rayleigh fading channel, an improved approach to extending the size of the decoding window based on the channel state information (CSI) is proposed, and the CSI is obtained by using the received signal-to-noise ratio (SNR). During the decoding process, if the average received SNR of the current window is less than the preset threshold, the decoding window is extended and then the iteration is performed again. The above process is repeated until the average received SNR of the current window is larger than the preset threshold or the window size is extended to its maximum value, and finally decoding is performed based on the extended window. Simulation results show that the SWD of SC-LDPC codes has a better performance over Rayleigh fading channels, and the performance of the proposed algorithm is significantly better than that of the traditional SWD algorithm.

Key words: spatially coupled low density parity check codes, Rayleigh fading channel, sliding window decoding

CLC Number:

TN911.22

ZHANG Yamei,ZHOU Lin,CHEN Chen,CHEN Qiwang,HE Yucheng. Sliding window decoding of the spatially coupled LDPC code Over Rayleigh fading channels[J].Journal of Xidian University, 2020, 47(6): 78-83.

Figures/Tables 4

References 17

[1]	FELSTROM A J, ZIGANGIROV K S. Time -varying Periodic Convolutional Codes with Low-Density Parity-Check Matrix[J]. IEEE Transactions on Information Theory, 1999, 45(6): 2181-2191. doi: 10.1109/18.782171
[2]	KUDEKAR S, RICHARDSON T J, URBANKE R L. Threshold Saturation Via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC[J]. IEEE Transactions on Information Theory, 2011, 57(2): 803-834. doi: 10.1109/TIT.2010.2095072
[3]	KUDEKAR S, RICHARDSON T, URBANKE R L. Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation[J]. IEEE Transactions on Information Theory, 2013, 59(12): 7761-7813. doi: 10.1109/TIT.2013.2280915
[4]	张昭基, 李颖. 适用于突发删除信道的非对称空间耦合LDPC码[J]. 西安电子科技大学学报, 2017, 44(5): 1-6.
	ZHANGZhaoji, LI Ying. Asymmetric spatially-coupled LDPC codes for burst erasure channels[J]. Journal of Xidian University, 2017, 44(5): 1-6.
[5]	孙岳, 李蓓蕾, 梁彩虹, 等. 块衰落信道下串联多链空间耦合LDPC码设计[J]. 西安电子科技大学学报, 2019, 46(2): 1-5.
	SUN Yue, LIBeilei, LIANG Caihong, et al. Design of Serial Connecting Multiple Spatially Coupled LDPC Codes for Block-fading Channels[J]. Journal of Xidian University, 2019, 46(2): 1-5.
[6]	KWAK H, YUN D, NO J. Rate-Loss Mitigation of SC-LDPC Codes Without Performance Degradation[J]. IEEE Transactions on Communications, 2020, 68(1): 55-65. doi: 10.1109/TCOMM.26
[7]	ZHAO Y L, FANG Y, YANG Z J. Interleaver Design for Small-Coupling-Length Spatially Coupled Protograph LDPC-Coded BICM Systems Over Wireless Fading Channels[J]. IEEE Access, 2020, 8: 33500-33510. doi: 10.1109/Access.6287639
[8]	张亚坤, 周林, 陈辰, 等. 速率无损失的有限长空间耦合LDPC码[J]. 电子学报, 2019, 47(12): 2590-2595.
	ZHANGYakun, ZHOU Lin, CHEN Chen, et al. Rate-loss-free Finite Length Spatially Coupled LDPC Codes[J]. Acta Electronica Sinica, 2019, 47(12): 2590-2595.
[9]	IYENGARA R, PAPALEO M, SIEGEL P H, et al. Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels[J]. IEEE Transactions on Information Theory, 2012, 58(4): 2303-2320. doi: 10.1109/TIT.2011.2177439
[10]	MO S, CHEN L. Improved Sliding Window Decoding of Spatially Coupled Low-density Parity-check Codes[C]// Proceedings of the 2017 IEEE International Symposium on Information Theory. Piscataway: IEEE, 2017: 126-130.
[11]	KLAIBER K, CAMMERER S, SCHMALEN L, et al. Avoiding Burst-like Error Patterns in Windowed Decoding of Spatially Coupled LDPC Codes[C]// Proceedings of the 2018 International Symposium on Turbo Codes and Iterative Information Processing. Washington: IEEE Computer Society, 2018: 8625312.
[12]	ALI I, KIMJ H, KIM S H, et al. Improving Windowed Decoding of SC LDPC Codes by Effective Decoding Termination, Message Reuse, and Amplification[J]. IEEE Access, 2017, 6: 9336-9346. doi: 10.1109/ACCESS.2017.2771375
[13]	张娅妹, 周林, 陈辰, 等. 窗口可变的空间耦合LDPC码滑窗译码算法[J]. 西安电子科技大学学报, 2020, 47(3): 128-134.
	ZHANGYamei, ZHOU Lin, CHEN Chen, et al. Sliding Window Decoding Algorithm for Spatially Coupled LDPC Codes with a Variable Window[J]. Journal of Xidian University, 2020, 47(3): 128-134.
[14]	KHITTIWITCHAYAKUL S, PHAKPHISUT W, SUPNITHI P. EXIT Chart Analysis of Serial Window Decoding of SC-LDPC Codes[C]// Proceedings of the 2019 34th International Technical Conference on Circuits/Systems, Computers and Communications. Piscataway: IEEE, 2019: 8793416.
[15]	DIVSALAR D, DOLINAR S, JONES C R, et al. Capacity Approaching Protograph Codes[J]. IEEE Journal on Selected Areas in Communications, 2009, 27(6): 876-888. doi: 10.1109/JSAC.2009.090806
[16]	MITCHELL D G M, LENTMAIER M, COSTELLO D J. Spatially Coupled LDPC Codes Constructed from Protographs[J]. IEEE Transactions on Information Theory, 2015, 61(9): 4866-4889. doi: 10.1109/TIT.18
[17]	孙韶辉, 贺玉成, 王新梅. 低密度校验码在瑞利衰落信道中的性能分析[J]. 计算机学报, 2002, 25(10): 1077-1082.
	SUNShaohui, HE Yucheng, WANG Xinmei. Performance of Low-Density Parity-Check Codes over Rayleigh Fading Channels[J]. Chinese Journal of Computers, 2002, 25(10): 1077-1082.

Sliding window decoding of the spatially coupled LDPC code Over Rayleigh fading channels

RichHTML

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 4

References 17

Related Articles 2

Metrics

Comments

Recommended 10

[1]	ZHANG Yamei,ZHOU Lin,CHEN Chen,GUO Rongxin,HE Yucheng. Sliding window decoding algorithm for spatially coupled LDPC codes with a variable window [J]. Journal of Xidian University, 2020, 47(3): 128-134.
[2]	HAN Fang-ming1;ZHANG Xian-da2. Matched filter bound for time-varying multipath Rayleigh fading channels [J]. J4, 2007, 34(2): 205-208.