Efficient Sphere Polar Decoding via Synchronous Determination

被引：9

作者：

Zhou, Huayi ^{[1
,2
,3
,4
]}

Gross, Warren J. ^{[5
]}

Zhang, Zaichen ^{[1
,2
,3
,4
]}

You, Xiaohu ^{[1
,2
,3
,4
]}

Zhang, Chuan ^{[1
,2
,3
,4
]}

机构：

[1] Southeast Univ, LEADS, Nanjing 211189, Peoples R China

[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Peoples R China

[3] Southeast Univ, Quantum Informat Ctr, Nanjing 211189, Peoples R China

[4] Southeast Univ, Purple Mt Labs, Nanjing 211189, Peoples R China

[5] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ H3A 0G4, Canada

来源：

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 2020年 / 69卷 / 06期

关键词：

Maximum likelihood decoding; Complexity theory; Signal to noise ratio; Silicon; Euclidean distance; Mobile communication; Polar codes; sphere decoding; synchronous determination;

D O I：

10.1109/TVT.2020.2986915

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Sphere polar decoding can achieve the maximum likelihood (ML) bound. Existing sphere polar decoding ignores that the Euclidean distance of the frozen bits can be determined at earlier decoding levels. In this article, efficient sphere polar decoding is proposed to reduce the complexity. The set-by-set decoding process via synchronous determination is applied to the sphere polar decoding with fixed lower bounds and its multiple-searches version. Numeric results show the proposed decoding reducesmuch complexity on the low-rate codes compared with the existing sphere decoding while maintaining the same performance. At high signal-to-noise ratios, the latency of the proposed decoding is comparable with the successive cancellation list decoding.

引用

页码：6777 / 6781

页数：5

共 21 条

[1]

[Anonymous], 2019, IEEE COMMUN LETT, DOI DOI 10.1109/LCOMM.2018.2885771

[2] On the rate of channel polarization [J].

Arikan, Erdal ;

Telatar, Emre .

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 [J].

Arikan, Erdal .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073

[4]

Doan N, 2019, IEEE ICC

[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 [J].

Hashemi, Seyyed Ali ;

Condo, Carlo ;

Gross, Warren J. .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (21) :5756-5769

[7]

Hashemi SA, 2015, 2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, P1346, DOI 10.1109/ACSSC.2015.7421362

[8] Reduced Latency ML Polar Decoding via Multiple Sphere-Decoding Tree Searches [J].

Husmann, Chistopher ;

Nikolaou, Panagiotis Chatzi ;

Nikitopoulos, Konstantinos .

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (02) :1835-1839

[9]

Kahraman S., 2012, Proceedings of the 2012 IEEE International Symposium on Information Theory - ISIT, P1967, DOI 10.1109/ISIT.2012.6283643

[10] CRC-Aided Decoding of Polar Codes [J].

Niu, Kai ;

Chen, Kai .

IEEE COMMUNICATIONS LETTERS, 2012, 16 (10) :1668-1671

← 1 2 3 →