系统极化码的低时延CA-SCL算法研究
|
摘要
文章为了降低极化码的串行抵消列表(Successive Cancellation List,SCL)算法的译码时延,利用简化串行抵消(Simplified SC,SSC)算法思想,设计实现了系统极化码(system polar code,SPC)低复杂度(low complexity)的循环冗余校验辅助串行抵消列表(CRC-Aided SCL,CA-SCL)译码,简称为SPC-LC-CA-SCL算法。仿真结果表明:极化码(1024,512)中"Rate-1"节点并行处理的门限值(Threshold Value)设为64时,SPC-LC-CA-SCL和SPC-CA-SCL算法性能一致,时延减少了6.35%。"Rate-1"节点并行处理的门限值设为32,16时,时延分别减少了17.78%和24.13%,性能则降低了0.4dB和0.5dB。
In order to reduce the decoding latency of the Successive Cancellation List(SCL)algorithm for the polar code. Based on the idea of Simplified SC(SSC) algorithm, this paper designs a low complexity CRC-Aided SCL decoding of system polar code(SPC), which is called SPC-LC-CA-SCL algorithm. The simulation results show that when the threshold value of parallel processing for the Rate-1 node is set to 64, for the polar code(1024, 512), the proposed SPC-LC-CA-SCL algorithm and SPCCA-SCL algorithm have the same performance, meanwhile, the decoding latency is reduced by 6.35%. When the threshold value of the parallel processing for the Rate-1 node is set to 32, 16, respectively, the decoding latency is reduced by 17.78% and24.13%, however, the decoding performance is degraded by 0.4 dB and 0.5 dB.
In order to reduce the decoding latency of the Successive Cancellation List(SCL)algorithm for the polar code. Based on the idea of Simplified SC(SSC) algorithm, this paper designs a low complexity CRC-Aided SCL decoding of system polar code(SPC), which is called SPC-LC-CA-SCL algorithm. The simulation results show that when the threshold value of parallel processing for the Rate-1 node is set to 64, for the polar code(1024, 512), the proposed SPC-LC-CA-SCL algorithm and SPCCA-SCL algorithm have the same performance, meanwhile, the decoding latency is reduced by 6.35%. When the threshold value of the parallel processing for the Rate-1 node is set to 32, 16, respectively, the decoding latency is reduced by 17.78% and24.13%, however, the decoding performance is degraded by 0.4 dB and 0.5 dB.
引文
[1]Arikan E.Channel polarization:a method for constructing capacity-achieving codes for symmetric binary input memoryless channels[J].IEEE Transactions on Information Theory,2009,55(7):3051-3073.
[2]Alamdar-Yazdi A,and Kschischang F R.A simplified successive cancellation decoder for polar codes.IEEE Commun.Lett[J].2011,15(12):1378-1380.
[3]Arikan E.Systematic polar coding.IEEE Commun.Lett[J].2011,15(8),pp:860-862.
[4]Sarkis G,Giard P,Vardy A,Thibeault C,and W.J.Gross.Fast polar decoders:Algorithm and implementation[J].IEEEJ.Sel.Areas Commun.2014,32(5):946-957.
[5]Vangala H,Hong Y,and Viterbo E.Efficient Algorithms for Systematic Polar Encoding.IEEE Communications Letters[J].2016,20(1):17-20.
[6]Tal I,and Vardy A.List decoding of polar codes[J].IEEETransactions on Information Theory,2015,61(5):2213-2226.
[7 Sarkis G,and Gross W J.Systematic encoding of polar codes for list decoding.2011,private communication.
[8]Sarkis G,Giard P,Vardy A,et al.Increasing the speed of polar list decoders[C],Preceedings of the IEEE Signal Processing Systems WorkShop,Belfast,2014:1-6.
[9]Lin Jun,Xiong Chen-rong,and Yan Zhi-yuan.A High Throughput List Decoder Architecture for Polar Codes,IEEE Transactions on Very Large Scale Integration(VLSI)Systems,2015,99(1):1-14.
[10]Alexios Balatsoukas-Stimming,Mani Bastani Parizi,and Andreas Burg.LLR-Based Successive Cancellation List Decoding of Polar Codes[J]IEEE Transactions on Signal Processing,2015,63(19):5165-5179.
[11]Huang Zhiliang,Diao Chunjuan,Dai Jianxin,et al.An Improvement of Modified Successive-Cancellation Decoder for Polar Codes[J].IEEE Communications Letters,2013,17(12):2360-2363.
[12]Tal I,and Vardy A.How to construct polar codes[J].IEEETransactions on Information Theory,2013,59(10):6562-6582.
[2]Alamdar-Yazdi A,and Kschischang F R.A simplified successive cancellation decoder for polar codes.IEEE Commun.Lett[J].2011,15(12):1378-1380.
[3]Arikan E.Systematic polar coding.IEEE Commun.Lett[J].2011,15(8),pp:860-862.
[4]Sarkis G,Giard P,Vardy A,Thibeault C,and W.J.Gross.Fast polar decoders:Algorithm and implementation[J].IEEEJ.Sel.Areas Commun.2014,32(5):946-957.
[5]Vangala H,Hong Y,and Viterbo E.Efficient Algorithms for Systematic Polar Encoding.IEEE Communications Letters[J].2016,20(1):17-20.
[6]Tal I,and Vardy A.List decoding of polar codes[J].IEEETransactions on Information Theory,2015,61(5):2213-2226.
[7 Sarkis G,and Gross W J.Systematic encoding of polar codes for list decoding.2011,private communication.
[8]Sarkis G,Giard P,Vardy A,et al.Increasing the speed of polar list decoders[C],Preceedings of the IEEE Signal Processing Systems WorkShop,Belfast,2014:1-6.
[9]Lin Jun,Xiong Chen-rong,and Yan Zhi-yuan.A High Throughput List Decoder Architecture for Polar Codes,IEEE Transactions on Very Large Scale Integration(VLSI)Systems,2015,99(1):1-14.
[10]Alexios Balatsoukas-Stimming,Mani Bastani Parizi,and Andreas Burg.LLR-Based Successive Cancellation List Decoding of Polar Codes[J]IEEE Transactions on Signal Processing,2015,63(19):5165-5179.
[11]Huang Zhiliang,Diao Chunjuan,Dai Jianxin,et al.An Improvement of Modified Successive-Cancellation Decoder for Polar Codes[J].IEEE Communications Letters,2013,17(12):2360-2363.
[12]Tal I,and Vardy A.How to construct polar codes[J].IEEETransactions on Information Theory,2013,59(10):6562-6582.