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!

Buďte prvý, kto okomentuje tento záznam!