A Low Complexity Encoding Algorithm for Systematic Polar Codes

Arıkan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an effici...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 20; číslo 7; s. 1277 - 1280
Hlavní autori: Chen, Guo Tai, Zhang, Zhaoyang, Zhong, Caijun, Zhang, Liang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.07.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Complexity
Complexity theory
Computation
Decoding
Electronic mail
Encoding
encoding algorithm
Gain
Indexes
Mathematical models
Memory management
parallel encoding
Polar codes
systematic polar codes
Systematics
ISSN:1089-7798, 1558-2558
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Arıkan has shown that systematic polar codes (SPC) outperform non-SPC (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared with NSPC, the available encoding methods for SPC require higher memory and computation. In this letter, we propose an efficient encoding algorithm requiring only N bits of memory and having (N/2)log 2 N XOR operations. Moreover, the auxiliary variables in the algorithm can share the memory to reduce extra memory requirement. Furthermore, a parallel 2-bit encoding algorithm is also presented to improve the encoding throughput. Remarkably, we show that parallel encoding can be implemented with the same number of XOR operations and memory bits. Finally, the proposed encoding algorithm can be directly used for NSPC with the same complexity.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2016.2560169