An optimized encoding algorithm for systematic polar codes

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 triang...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:EURASIP journal on wireless communications and networking Ročník 2019; číslo 1; s. 1 - 12
Hlavní autori: Wang, Xiumin, Zhang, Zhihong, Li, Jun, Wang, Yu, Cao, Haiyan, Li, Zhengquan, Shan, Liang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cham Springer International Publishing 01.08.2019
Springer Nature B.V
SpringerOpen
Predmet:
Algorithms
Codes
Communications Engineering
Computation
Computing units
Encoding algorithm
Engineering
Generator matrix transformation
Information Systems Applications (incl.Internet)
Iterative methods
Low complexity
Networks
Segmentation
Signal,Image and Speech Processing
Systematic polar codes
Encoding algorithm
Computing units
Systematic polar codes
Low complexity
Generator matrix transformation
ISSN:1687-1499, 1687-1472, 1687-1499
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-1499
1687-1472
1687-1499
DOI:10.1186/s13638-019-1491-4