A complexity-reduced fast successive cancellation list decoder for polar codes  

A complexity-reduced fast successive cancellation list decoder for polar codes

在线阅读下载全文

作  者:Qingyun XU Zhiwen PAN Nan LIU Xiaohu YOU 

机构地区:[1]National Mobile Communications Research Laboratory, Southeast University

出  处:《Science China(Information Sciences)》2018年第2期134-144,共11页中国科学(信息科学)(英文版)

基  金:supported by National Major Project(Grant No.2016ZX030010-11005);National Natural Science Foundation Project(Grant No.61521061);Intel Corporation

摘  要:A multi-bit decision for polar codes based on a simplified successive cancellation(SSC) decoding algorithm can improve the throughput of polar decoding. A list algorithm is used to improve the errorcorrecting performance. However, list decoders are highly complex compared with decoders without a list algorithm. In this paper, a low-complexity list decoder is proposed, where path-splitting operations for a multi-bit decision can be avoided, if the decoding reliability exceeds a threshold. The threshold is determined based on the reliability of subchannels and positions of decoding nodes. Path splitting rules are designed for multi-bit decision processes, and a complexity-reduced list decoder is proposed based on this. Results show that the number of survival paths can be greatly reduced at the cost of negligible deterioration in block error performance. Thus, the computational complexity can be significantly reduced, especially for a high signal-to-noise ratio(SNR) region.A multi-bit decision for polar codes based on a simplified successive cancellation(SSC) decoding algorithm can improve the throughput of polar decoding. A list algorithm is used to improve the errorcorrecting performance. However, list decoders are highly complex compared with decoders without a list algorithm. In this paper, a low-complexity list decoder is proposed, where path-splitting operations for a multi-bit decision can be avoided, if the decoding reliability exceeds a threshold. The threshold is determined based on the reliability of subchannels and positions of decoding nodes. Path splitting rules are designed for multi-bit decision processes, and a complexity-reduced list decoder is proposed based on this. Results show that the number of survival paths can be greatly reduced at the cost of negligible deterioration in block error performance. Thus, the computational complexity can be significantly reduced, especially for a high signal-to-noise ratio(SNR) region.

关 键 词:polar codes low-complexity decoder splitting-reduced multi-bit decision list decoder 

分 类 号:TN911.22[电子电信—通信与信息系统]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象