中国邮电高校学报(英文)

中国邮电高校学报(英文) ›› 2013, Vol. 20 ›› Issue (1): 91-94.doi: 10.1016/S1005-8885(13)60013-8

• Wireless • 上一篇    下一篇

New encoding scheme of polar codes

王军选   

  1. 西安邮电学大学
  • 收稿日期:2012-06-11 修回日期:2012-09-15 出版日期:2013-02-28 发布日期:2013-02-28
  • 通讯作者: 王军选 E-mail:wangjx@xupt.edu.cn
  • 基金资助:

    This work was supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (2012ZX03001025-004), the National Natural Science Foundation of China (61271276), and the Natural Science Foundation of Shaanxi Education Bureau (09Jk726).

New Encoding Scheme of Polar Codes

junxuan wang   

  1. School of Communication and Information Engineering, Xi’an University of Posts and Telecommunications, Xi’an 710121, China
  • Received:2012-06-11 Revised:2012-09-15 Online:2013-02-28 Published:2013-02-28
  • Contact: junxuan wang E-mail:wangjx@xupt.edu.cn
  • Supported by:

    This work was supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (2012ZX03001025-004), the National Natural Science Foundation of China (61271276), and the Natural Science Foundation of Shaanxi Education Bureau (09Jk726).

摘要：

The ‘polar coding’ proposed by Dr. Ar?kan can achieve the symmetric capacity of binary-input discrete memoryless channels (B-DMC). The generator matrix of polar codes is for N=2n, BN was a permutation matrix. In the article it was realized with an interleaver, so the matrix production of GN was avoided; then the generator matrix was just determined by the matrix which was constructed with three sub-matrixes of and one order zero matrix, it was deal with fast Hadamard transform (FHT) algorithm. The complexity of the new scheme was reduced sharply, and an iterative algorithm also can be used. The example showed that when N=8, complexity of the encoding scheme was just 16 which is obviously less than that of original encoding scheme 36.

关键词:

polar codes, fast Hadamard translation (FHT), encoding complexity

Abstract:

The ‘polar coding’ proposed by Dr. Ar?kan can achieve the symmetric capacity of binary-input discrete memoryless channels (B-DMC). The generator matrix of polar codes is for N=2n, BN was a permutation matrix. In the article it was realized with an interleaver, so the matrix production of GN was avoided; then the generator matrix was just determined by the matrix which was constructed with three sub-matrixes of and one order zero matrix, it was deal with fast Hadamard transform (FHT) algorithm. The complexity of the new scheme was reduced sharply, and an iterative algorithm also can be used. The example showed that when N=8, complexity of the encoding scheme was just 16 which is obviously less than that of original encoding scheme 36.

Key words:

polar codes, fast Hadamard translation (FHT), encoding complexity

版权所有 © 2020 中国邮电高校学报(英文)编辑部　
　 地址：北京邮电大学图书馆1层119 室　邮政编码：100081
Tel：86-010-62282493　Fax： 86-010-62283461　E-mail: jchupt@bupt.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持：support@magtech.com.cn