Nonbinary polar codes constructions based on k-means clustering |
|
Author: | Park, Giyoon1; Park, Ok-Sun1; Jo, Gweondo1; |
Organizations: |
1ETRI, Daejeon, Korea 2University of Oulu, City of Oulu, Finland |
Format: | article |
Version: | accepted version |
Access: | open |
Online Access: | PDF Full Text (PDF, 0.2 MB) |
Persistent link: | http://urn.fi/urn:nbn:fi-fe202301183504 |
Language: | English |
Published: |
Institute of Electrical and Electronic Engineers,
2021
|
Publish Date: | 2023-01-18 |
Description: |
AbstractThis study investigates an efficient code construction method based on the Density evolution scheme, which has a component of channel merge routine. In this paper, k-means clustering algorithm is proposed for channel merging. By inspecting the merged channels, bit channels are ordered in estimated reliability. Simulation results show that the proposed channel merging algorithm achieves marginal capacity loss of nonbinary polar coded modulation. see all
|
Series: |
International Conference on Information and Communication Technology Convergence |
ISSN: | 2162-1233 |
ISSN-E: | 2162-1241 |
ISSN-L: | 2162-1233 |
Pages: | 640 - 643 |
DOI: | 10.1109/ICTC52510.2021.9621127 |
OADOI: | https://oadoi.org/10.1109/ICTC52510.2021.9621127 |
Conference: |
International Conference on Information and Communication Technology Convergence |
Type of Publication: |
A4 Article in conference proceedings |
Field of Science: |
213 Electronic, automation and communications engineering, electronics |
Subjects: | |
Funding: |
This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No. 2020-0-01316, International cooperation and collaborative research on 5 mathrm G technologies for ultra-reliability low latency communications). |
Copyright information: |
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |