On puncturing strategies for polar codes
Description | |
Date | |
Authors | Chandesris L., Savin V., Declercq D. |
Year | 2017-0319 |
Source-Title | 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017 |
Affiliations | CEA-LETI, Minatec Campus, Grenoble, France, ETIS, ENSEA/UCP/CNRS, Cergy-Pontoise, France |
Abstract | This paper introduces a class of specific puncturing patterns, called symmetric puncturing patterns, which can be characterized and generated from the rows of the generator matrix GN. They are first shown to be non-equivalent, then a low-complexity method to generate symmetric puncturing patterns is proposed, which performs a search tree algorithm with limited depth, over the rows of GN. Symmetric patterns are further optimized by density evolution, and shown to yield better performance than state-of-the-art rate compatible code constructions, relying on either puncturing or shortening techniques. © 2017 IEEE. |
Author-Keywords | Equivalent puncturing patterns, Punctured polar codes, Symmetric puncturing patterns |
Index-Keywords | Trees (mathematics), Density evolution, Generator matrix, Polar codes, Puncturing patterns, Rate compatible codes, Search tree algorithms, State of the art, Symmetric patterns, Codes (symbols) |
ISSN | |
Link | Link |