Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches
Polar codes, which have been proposed as a family of linear block codes, has garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provably capacity-achieving capability. Thus, they have been proposed to be used for encoding information on the co...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-07-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/10/14/1717 |
id |
doaj-6ec2e087cf1c43ddaa6b522221ef2de6 |
---|---|
record_format |
Article |
spelling |
doaj-6ec2e087cf1c43ddaa6b522221ef2de62021-07-23T13:38:19ZengMDPI AGElectronics2079-92922021-07-01101717171710.3390/electronics10141717Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching ApproachesSouradip Saha0Marc Adrat1Fraunhofer Institute for Communication, Information Processing and Ergonomics, Fraunhoferstraße 20, 53343 Wachtberg, GermanyFraunhofer Institute for Communication, Information Processing and Ergonomics, Fraunhoferstraße 20, 53343 Wachtberg, GermanyPolar codes, which have been proposed as a family of linear block codes, has garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provably capacity-achieving capability. Thus, they have been proposed to be used for encoding information on the control channels in the upcoming 5G wireless networks. The basic approach introduced by Arikan in his landmark paper to polarize bit channels of equal capacities to those of unequal capacities can be used to design only codewords of length <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><msup><mn>2</mn><mi>n</mi></msup></mrow></semantics></math></inline-formula>, which is a major limitation when codewords of different lengths are required for the underlying applications. In the predecessor paper, this aspect was partially addressed by using a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>3</mn></mrow></semantics></math></inline-formula> kernel circuit (used to generate codewords of length <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>M</mi><mo>=</mo><msup><mn>3</mn><mi>m</mi></msup></mrow></semantics></math></inline-formula>), along with downsizing techniques such as puncturing and shortening to asses the optimal design and resizing techniques based on the underlying system parameters. In this article, we extend this research to include the assessment of multi-kernel rate-matched polar codes for applicability over a much wider range of codeword lengths.https://www.mdpi.com/2079-9292/10/14/1717polar codespuncturingshorteningmulti-kernel5G |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Souradip Saha Marc Adrat |
spellingShingle |
Souradip Saha Marc Adrat Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches Electronics polar codes puncturing shortening multi-kernel 5G |
author_facet |
Souradip Saha Marc Adrat |
author_sort |
Souradip Saha |
title |
Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches |
title_short |
Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches |
title_full |
Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches |
title_fullStr |
Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches |
title_full_unstemmed |
Multi-Kernel Polar Codes versus Classical Designs with Different Rate-Matching Approaches |
title_sort |
multi-kernel polar codes versus classical designs with different rate-matching approaches |
publisher |
MDPI AG |
series |
Electronics |
issn |
2079-9292 |
publishDate |
2021-07-01 |
description |
Polar codes, which have been proposed as a family of linear block codes, has garnered a lot of attention from the scientific community, owing to their low-complexity implementation and provably capacity-achieving capability. Thus, they have been proposed to be used for encoding information on the control channels in the upcoming 5G wireless networks. The basic approach introduced by Arikan in his landmark paper to polarize bit channels of equal capacities to those of unequal capacities can be used to design only codewords of length <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><msup><mn>2</mn><mi>n</mi></msup></mrow></semantics></math></inline-formula>, which is a major limitation when codewords of different lengths are required for the underlying applications. In the predecessor paper, this aspect was partially addressed by using a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>3</mn><mo>×</mo><mn>3</mn></mrow></semantics></math></inline-formula> kernel circuit (used to generate codewords of length <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>M</mi><mo>=</mo><msup><mn>3</mn><mi>m</mi></msup></mrow></semantics></math></inline-formula>), along with downsizing techniques such as puncturing and shortening to asses the optimal design and resizing techniques based on the underlying system parameters. In this article, we extend this research to include the assessment of multi-kernel rate-matched polar codes for applicability over a much wider range of codeword lengths. |
topic |
polar codes puncturing shortening multi-kernel 5G |
url |
https://www.mdpi.com/2079-9292/10/14/1717 |
work_keys_str_mv |
AT souradipsaha multikernelpolarcodesversusclassicaldesignswithdifferentratematchingapproaches AT marcadrat multikernelpolarcodesversusclassicaldesignswithdifferentratematchingapproaches |
_version_ |
1721288675945349120 |