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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 20; no. 7; pp. 1277 - 1280
Main Authors:	Chen, Guo Tai, Zhang, Zhaoyang, Zhong, Caijun, Zhang, Liang
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!