Polar Code Design for Irregular Multidimensional Constellations
Polar codes, ever since their introduction, have been shown to be very effective for various wireless communication channels. This, together with their relatively low implementation complexity, has made them an attractive coding scheme for wireless communications. Polar codes have been extensively s...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8070116/ |
id |
doaj-e0791f76a48841949e8ee80bf7a73944 |
---|---|
record_format |
Article |
spelling |
doaj-e0791f76a48841949e8ee80bf7a739442021-03-29T20:20:10ZengIEEEIEEE Access2169-35362017-01-015219412195310.1109/ACCESS.2017.27636148070116Polar Code Design for Irregular Multidimensional ConstellationsPhilip R. Balogun0Ian D. Marsland1https://orcid.org/0000-0002-8991-9093Ramy H. Gohary2Halim Yanikomeroglu3https://orcid.org/0000-0003-4776-9354Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, CanadaDepartment of Systems and Computer Engineering, Carleton University, Ottawa, ON, CanadaDepartment of Systems and Computer Engineering, Carleton University, Ottawa, ON, CanadaDepartment of Systems and Computer Engineering, Carleton University, Ottawa, ON, CanadaPolar codes, ever since their introduction, have been shown to be very effective for various wireless communication channels. This, together with their relatively low implementation complexity, has made them an attractive coding scheme for wireless communications. Polar codes have been extensively studied for use with binary-input symmetric memoryless channels but little is known about their effectiveness in other channels. In this paper, a novel methodology for designing multilevel polar codes that works effectively with arbitrary multidimensional constellations is presented. In order for this multilevel design to function, a novel set merging algorithm, able to label such constellations, is proposed. We then compare the error rate performance of our design with that of existing schemes and show that we were able to obtain unprecedented results in many cases over the previously known best techniques at relatively low decoding complexity.https://ieeexplore.ieee.org/document/8070116/Set mergingset partitioningbit labelingmultilevel polar codescode design |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Philip R. Balogun Ian D. Marsland Ramy H. Gohary Halim Yanikomeroglu |
spellingShingle |
Philip R. Balogun Ian D. Marsland Ramy H. Gohary Halim Yanikomeroglu Polar Code Design for Irregular Multidimensional Constellations IEEE Access Set merging set partitioning bit labeling multilevel polar codes code design |
author_facet |
Philip R. Balogun Ian D. Marsland Ramy H. Gohary Halim Yanikomeroglu |
author_sort |
Philip R. Balogun |
title |
Polar Code Design for Irregular Multidimensional Constellations |
title_short |
Polar Code Design for Irregular Multidimensional Constellations |
title_full |
Polar Code Design for Irregular Multidimensional Constellations |
title_fullStr |
Polar Code Design for Irregular Multidimensional Constellations |
title_full_unstemmed |
Polar Code Design for Irregular Multidimensional Constellations |
title_sort |
polar code design for irregular multidimensional constellations |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2017-01-01 |
description |
Polar codes, ever since their introduction, have been shown to be very effective for various wireless communication channels. This, together with their relatively low implementation complexity, has made them an attractive coding scheme for wireless communications. Polar codes have been extensively studied for use with binary-input symmetric memoryless channels but little is known about their effectiveness in other channels. In this paper, a novel methodology for designing multilevel polar codes that works effectively with arbitrary multidimensional constellations is presented. In order for this multilevel design to function, a novel set merging algorithm, able to label such constellations, is proposed. We then compare the error rate performance of our design with that of existing schemes and show that we were able to obtain unprecedented results in many cases over the previously known best techniques at relatively low decoding complexity. |
topic |
Set merging set partitioning bit labeling multilevel polar codes code design |
url |
https://ieeexplore.ieee.org/document/8070116/ |
work_keys_str_mv |
AT philiprbalogun polarcodedesignforirregularmultidimensionalconstellations AT iandmarsland polarcodedesignforirregularmultidimensionalconstellations AT ramyhgohary polarcodedesignforirregularmultidimensionalconstellations AT halimyanikomeroglu polarcodedesignforirregularmultidimensionalconstellations |
_version_ |
1724194935715921920 |