Efficient Implementation of Density Evolution for Punctured Polar Codes
Polar codes asymptotically achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under low-complexity sequential decoding algorithms such as successive cancellation decoding. However, in their original formulation, the block length of polar codes is limited to integer...
Main Authors: | Christopher Schnelling, Markus Rothe, Niklas Koep, Rudolf Mathar, Anke Schmeink |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8764398/ |
Similar Items
-
Optimal Puncturing of Polar Codes With a Fixed Information Set
by: Liping Li, et al.
Published: (2019-01-01) -
Design of Rate-Compatible Parallel Concatenated Punctured Polar Codes for IR-HARQ Transmission Schemes
by: Jian Jiao, et al.
Published: (2017-11-01) -
Construction of Rate-Compatible LDPC Codes Utilizing Information Shortening and Parity Puncturing
by: Jones Christopher R, et al.
Published: (2005-01-01) -
Cooperative Punctured Polar Coding (CPPC) Scheme Based on Plotkin’s Construction
by: T. Soliman, et al.
Published: (2016-09-01) -
Low-Density Parity-Check Codes with Erasures and Puncturing
by: Ha, Jeongseok Ha
Published: (2005)