An Improved Software List Sphere Polar Decoder With Synchronous Determination

被引:14
作者
Zhou, Huayi [1 ,2 ]
Tan, Xiaosi [1 ,2 ]
Gross, Warren J. [3 ]
Zhang, Zaichen [1 ,2 ]
You, Xiaohu [1 ,2 ]
Zhang, Chuan [1 ,2 ]
机构
[1] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
[2] Purple Mt Labs, Nanjing 210096, Jiangsu, Peoples R China
[3] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ H3A 0G4, Canada
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Polar codes; list sphere decoding; synchronous determination; software decoder; CODES;
D O I
10.1109/TVT.2019.2912709
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Being the first codes achieving the capacity of symmetric binary-input discrete memoryless channels, polar codes have been favorable and standardized for enhanced mobile broadband (eMBB) control channels. In future mobile communications, the entire system is required to be flexible and adaptive to varying scenarios. Therefore, efficient software implementation of polar decoder is expected. Existing software successive cancellation list polar decoder can achieve good performance but with a good memory consumption. For short control channel codes, a more memory-efficient alternative is sphere decoder, but its latency gives rise to another issue. Equipped with a breadth-first search to keep a fixed complexity, list sphere decoder (LSD) is also considered. To improve the performance of LSD, a software LSD with synchronous determination is proposed in this paper. We precalculate the synchro sets to improve the decoding, which leads to a performance gain. Meanwhile, the decoding process is simplified due to the precalculation, which attains even lower complexity. Implemented with C++, the proposed decoder can achieve up to 2 dB performance gain compared with the existing LSD.
引用
收藏
页码:5236 / 5245
页数:10
相关论文
共 19 条
  • [1] [Anonymous], 1981, ACM SIGSAM Bulletin
  • [2] On the rate of channel polarization
    Arikan, Erdal
    Telatar, Emre
    [J]. 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1493 - +
  • [3] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
    Arikan, Erdal
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3051 - 3073
  • [4] FINCKE U, 1985, MATH COMPUT, V44, P463, DOI 10.1090/S0025-5718-1985-0777278-8
  • [5] Guo J, 2015, IEEE INT SYMP INFO, P236, DOI 10.1109/ISIT.2015.7282452
  • [6] Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
    Hashemi, Seyyed Ali
    Condo, Carlo
    Gross, Warren J.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (21) : 5756 - 5769
  • [7] A Fast Polar Code List Decoder Architecture Based on Sphere Decoding
    Hashemi, Seyyed Ali
    Condo, Carlo
    Gross, Warren J.
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2016, 63 (12) : 2368 - 2380
  • [8] Hashemi SA, 2016, IEEE INT SYMP CIRC S, P1730, DOI 10.1109/ISCAS.2016.7538902
  • [9] Hashemi SA, 2015, 2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, P1346, DOI 10.1109/ACSSC.2015.7421362
  • [10] On the sphere-decoding algorithm I. Expected complexity
    Hassibi, B
    Vikalo, H
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (08) : 2806 - 2818