Paper Info
Title
An optimized encoding algorithm for systematic polar codes
Abstract
Many different encoding algorithms for systematic polar codes (SPC) have been introduced since SPC was proposed in 2011. However, the number of the computing units of exclusive OR (XOR) has not been optimized yet. According to an iterative property of the generator matrix and particular lower triangular structure of the matrix, we propose an optimized encoding algorithm (OEA) of SPC that can reduce the number of XOR computing units compared with existing non-recursive algorithms. We also prove that this property of the generator matrix could extend to different code lengths and rates of the polar codes. Through the matrix segmentation and transformation, we obtain a submatrix with all zero elements to save computation resources. The proportion of zero elements in the matrix can reach up to 58.5% from the OEA for SPC when the code length and code rate are 2048 and 0.5, respectively. Furthermore, the proposed OEA is beneficial to hardware implementation compared with the existing recursive algorithms in which signals are transmitted bidirectionally.
Year
DOI
Venue
2019
10.1186/s13638-019-1491-4
EURASIP Journal on Wireless Communications and Networking
Keywords
DocType
Volume
Encoding algorithm, Low complexity, Computing units, Systematic polar codes, Generator matrix transformation
Journal
2019
Issue
ISSN
Citations 
1
1687-1499
0
PageRank 
References 
Authors
0.34
0
7
Name
Order
Citations
PageRank
Xiumin Wang198.85
Zhihong Zhang223.75
Jun Li3738.17
Yu Wang4783.70
Haiyan Cao5122.51
Zheng-quan Li63013.94
Liang Shan701.69