极化码离散CRC辅助译码
|
摘要
在中短码长下,不带循环冗余校验(CRC)辅助的极化码已经不具有竞争力,为了增强极化码译码性能,一般采用CRC辅助译码。针对传统的集中式CRC辅助方案只能在译码结束后选择路径而无法在译码中做剪枝操作,文章提出一种通过交织器在极化码信息比特间离散分配CRC比特的辅助译码方案,此方案允许CRC比特能够辅助串行抵消列表(SCL)译码期间幸存路径的选择以改善差错性能。仿真结果表明,与集中式CRC辅助译码方案相比,该算法在码率为0.125、误块率在10~(-1)以下、CRC长度为8时提供0.5 dB增益;CRC长度为16时提供1.3 dB增益。
In the medium and short code lengths, the performance of the polar code without Cyclic Redundancy Check(CRC) assistance is not competitive. In order to increase the decoding performance of the polarization code, CRC assisted decoding is generally used. For the traditional centralized CRC auxiliary scheme, the path can only be selected after the end of decoding and cannot be pruned in the decoding. This paper proposes an auxiliary decoding scheme for discretely allocating CRC bits between the bits of the polar code information through the interleaver. The scheme allows the CRC bits to assist in the selection of survivor paths during Successive Cancellation List(SCL) decoding process to improve the error performance. Simulation results show that compared with the centralized CRC-assisted decoding scheme. Simulation results show that compared with the centralized CRC-assisted decoding scheme, when the code rate is 0.125、block error rate is 10~(-1), the algorithm provides 0.5 and 1.3 dB gain while the length of CRC is 8 and 16 bits respectively.
In the medium and short code lengths, the performance of the polar code without Cyclic Redundancy Check(CRC) assistance is not competitive. In order to increase the decoding performance of the polarization code, CRC assisted decoding is generally used. For the traditional centralized CRC auxiliary scheme, the path can only be selected after the end of decoding and cannot be pruned in the decoding. This paper proposes an auxiliary decoding scheme for discretely allocating CRC bits between the bits of the polar code information through the interleaver. The scheme allows the CRC bits to assist in the selection of survivor paths during Successive Cancellation List(SCL) decoding process to improve the error performance. Simulation results show that compared with the centralized CRC-assisted decoding scheme. Simulation results show that compared with the centralized CRC-assisted decoding scheme, when the code rate is 0.125、block error rate is 10~(-1), the algorithm provides 0.5 and 1.3 dB gain while the length of CRC is 8 and 16 bits respectively.
引文
[1] Arikan E.Channel Polarization:A Method for Constructing Capacity-achieving Codes[C]// IEEE International Symposium on Information Theory.Toronto,Canada:IEEE ,2008:1173-1177.
[2] Arikan E,Telatar E.On the Rate of Channel Polarization[C]// IEEE International Symposium on Information Theory.Seoul,South Korea:IEEE,2009:1493-1495.
[3] Tal I,Vardy A.List Decoding of Polar Codes[J].IEEE Transactions on Information Theory,2015,61(5):2213-2226.
[4] Ercan F,Condo C,Hashemi S A,et al.On Error-Correction Performance and Implementation of Polar Code List Decoders for 5G [C]// The 55th Annual Allerton Conference on Communication,Control,and Computing(Allerton).Monticello,IL,USA:IEEE ,2017:443-449.
[5] Niu Kai,Chen Kai.CRC-Aided Decoding of Polar Codes[J].IEEE Communications Letters,2012,16(10):1668-1671.
[6] Mori R,Tanaka T.Performance of Polar Codes with the Construction Using Density Evolution[J].IEEE Communications Letters,2009,13(7):519-521.
[7] 陈凯.极化编码理论与实用方案研究[D].北京:北京邮电大学,2014.
[8] Schürch C.A Partial Order for the Synthesized Channels of a Polar Code [C]// IEEE International Symposium on Information Theory.Barcelona,Spain:IEEE,2016:220-224.
[9] He G N,Belfiore J C,Land I,et al.Beta-expansion:a Theoretical Framework for Fast and Recursive Construction of Polar Codes [C]// IEEE Global Communications Conference.Singapore:IEEE,2017:1-6.
[10] Tao W,Dai M Q,Tao J.Parity Check Concatenated Polar Codes[J].IEEE Communications Letters,2016,20(12):2342-2345.
[2] Arikan E,Telatar E.On the Rate of Channel Polarization[C]// IEEE International Symposium on Information Theory.Seoul,South Korea:IEEE,2009:1493-1495.
[3] Tal I,Vardy A.List Decoding of Polar Codes[J].IEEE Transactions on Information Theory,2015,61(5):2213-2226.
[4] Ercan F,Condo C,Hashemi S A,et al.On Error-Correction Performance and Implementation of Polar Code List Decoders for 5G [C]// The 55th Annual Allerton Conference on Communication,Control,and Computing(Allerton).Monticello,IL,USA:IEEE ,2017:443-449.
[5] Niu Kai,Chen Kai.CRC-Aided Decoding of Polar Codes[J].IEEE Communications Letters,2012,16(10):1668-1671.
[6] Mori R,Tanaka T.Performance of Polar Codes with the Construction Using Density Evolution[J].IEEE Communications Letters,2009,13(7):519-521.
[7] 陈凯.极化编码理论与实用方案研究[D].北京:北京邮电大学,2014.
[8] Schürch C.A Partial Order for the Synthesized Channels of a Polar Code [C]// IEEE International Symposium on Information Theory.Barcelona,Spain:IEEE,2016:220-224.
[9] He G N,Belfiore J C,Land I,et al.Beta-expansion:a Theoretical Framework for Fast and Recursive Construction of Polar Codes [C]// IEEE Global Communications Conference.Singapore:IEEE,2017:1-6.
[10] Tao W,Dai M Q,Tao J.Parity Check Concatenated Polar Codes[J].IEEE Communications Letters,2016,20(12):2342-2345.