西安电子科技大学学报

• 研究论文 • 上一篇    下一篇

极化码串行抵消多比特翻转译码算法

李桂萍;慕建君;焦晓鹏   

  1. (西安电子科技大学 计算机学院,陕西 西安 710071)
  • 收稿日期:2016-03-25 出版日期:2017-04-20 发布日期:2017-05-26
  • 作者简介:李桂萍(1978-),女,西安电子科技大学博士研究生,E-mail: llxghp@sina.com
  • 基金资助:

    国家自然科学基金资助项目(61471286,61271004)

Successive cancellation multibit-flipping decoding algorithm for polar codes

LI Guiping;MU Jianjun;JIAO Xiaopeng   

  1. (School of Computer Science and Technology, Xidian Univ., Xi'an 710071, China)
  • Received:2016-03-25 Online:2017-04-20 Published:2017-05-26

摘要:

对码字中出现错误位数概率的研究表明,1位错和2位错是影响中短码长极化码译码性能的主要原因.基于译码错误比特的统计分析,提出了一种串行抵消多比特翻转译码算法.与串行抵消单比特翻转译码算法相比,该译码算法能获得更好的性能增益,且码长越短,性能增益越明显.与通过并行搜索多条路径的串行抵消列表译码相比,所提出的算法具有较低空间复杂度,且译码复杂度随信噪比的增加而逐渐减小.仿真结果表明,针对中短码长,该算法在高信噪比下能以较低的平均译码复杂度逼近串行抵消列表译码算法的性能.

关键词: 极化码, 串行抵消译码, 比特翻转, 列表译码

Abstract:

The investigation of the probability of error bits in a codeword shows that single-bit errors and 2-bit errors are main reasons that influence the decoding performance of polar codes with a short or moderate blocklength. Based on the statistical analysis of the error bits, a successive cancellation(SC) multibit-flipping decoding algorithm is proposed. Compared with the SC single-bit-flipping decoding, the proposed scheme can obtain better performance gains for polar codes with a short blocklength. Compared with the SC list decoding by exploring multiple paths simultaneously, the proposed scheme has a lower space complexity. Moreover, the decoding complexity of the proposed decoding algorithm decreases as the signal to noise ratio(SNR) increases. Simulation shows that for polar codes with a short or moderate blocklength, the performance of the proposed decoder can approach that of the SC list decoding with lower decoding complexity in high SNR regions.

Key words: polar codes, successive cancellation decoding, bit-flipping, list decoding

Baidu
map