Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Construction of punctured polar codes based on genetic algorithm
Loading...
Thumbnail Image

Construction of punctured polar codes based on genetic algorithm

Author(s)
Mueadkhunthod, Krittiyaporn
Min Myint, Lin Min
Supnithi, Pornchai
Phakphisut, Watid
Date Issued
May 19, 2021
Type
Conference Paper
DOI
10.1109/ECTI-CON51831.2021.9454908
Abstract
In this work, we propose a new construction of punctured polar codes, which provides a good error-correcting performance at arbitrary code lengths and code rates. We exploit the density evolution to evaluate the error probability of punctured polar codes. Then, the puncturing pattern and frozen bit positions are selected by genetic algorithm to construct a punctured polar code with low error probability. The results show that the proposed technique provides superior block error rate performance than the quasi-uniform puncturing technique at a high code rate. At a low code rate, the proposed technique can show the better performance than the shortening technique.
Citation
Ecti Con 2021 2021 18th International Conference on Electrical Engineering Electronics Computer Telecommunications and Information Technology Smart Electrical System and Technology Proceedings, 378-381, 2021
Subjects

Density evolution

Genetic algorithm

Polar code

Puncturing

Shortening

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback