On puncturing strategies for polar codes
| Autor: | Ludovic Chandesris, David Declercq, Valentin Savin |
|---|---|
| Přispěvatelé: | Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Equipes Traitement de l'Information et Systèmes (ETIS - UMR 8051), Ecole Nationale Supérieure de l'Electronique et de ses Applications (ENSEA)-Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), European Project: 671650,H2020,H2020-ICT-2014-2,mmMAGIC(2015) |
| Rok vydání: | 2017 |
| Předmět: |
FOS: Computer and information sciences
business.industry Computer science Computer Science - Information Theory Information Theory (cs.IT) 020208 electrical & electronic engineering Equivalent puncturing patterns 020206 networking & telecommunications 02 engineering and technology Mathematics::Geometric Topology Puncturing [SPI]Engineering Sciences [physics] Punctured polar codes 0202 electrical engineering electronic engineering information engineering Code (cryptography) Symmetric matrix Generator matrix business Algorithm Computer hardware Decoding methods Symmetric puncturing patterns |
| Zdroj: | ICC Workshops Communications Workshops (ICC Workshops), 2017 IEEE International Conference on Communications Workshops (ICC Workshops), 2017 IEEE International Conference on, May 2017, Paris, France. pp.766-771, ⟨10.1109/ICCW.2017.7962751⟩ 2017 IEEE International Conference on Communications Workshops (ICC Workshops) |
| DOI: | 10.1109/iccw.2017.7962751 |
| Popis: | 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 $G_N$. 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 $G_N$. 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. Comment: 6 pages, submitted to ICC 2017 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|