Fast Successive-Cancellation Decoding of 2 x 2 Kernel Non-Binary Polar Codes: Identification, Decoding and Simplification Article Swipe

PDF

Ali Farsiabi , Hamid Ebrahimzad , Masoud Ardakani , Chuandong Li ·

YOU? · · 2024 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2401.07433

Non-binary polar codes (NBPCs) decoded by successive cancellation (SC) algorithm have remarkable bit-error-rate performance compared to the binary polar codes (BPCs). Due to the serial nature, SC decoding suffers from large latency. The latency issue in BPCs has been the topic of extensive research and it has been notably resolved by the introduction of fast SC-based decoders. However, the vast majority of research on NBPCs is devoted to issues concerning design and efficient implementation. In this paper, we propose fast SC decoding for NBPCs constructed based on 2 x 2 kernels. In particular, we identify various non-binary special nodes in the SC decoding tree of NBPCs and propose their fast decoding. This way, we avoid traversing the full decoding tree and significantly reduce the decoding delay compared to symbol-by-symbol SC decoding. We also propose a simplified NBPC structure that facilitates the procedure of non-binary fast SC decoding. Using our proposed fast non-binary decoder, we observed an improvement of up to 95% in latency concerning the original SC decoding. This is while our proposed fast SC decoder for NBPCs incurs no error-rate loss.

Related Topics

Concepts

Decoding methods List decoding Sequential decoding Computer science Binary number Algorithm Berlekamp–Welch algorithm Arithmetic Mathematics Concatenated error correction code Block code

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2401.07433
PDF: https://arxiv.org/pdf/2401.07433
OA Status: green
Related Works: 10
OpenAlex ID: https://openalex.org/W4390962227

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4390962227

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.48550/arxiv.2401.07433

Digital Object Identifier
Title: Fast Successive-Cancellation Decoding of 2 x 2 Kernel Non-Binary Polar Codes: Identification, Decoding and Simplification

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2024

Year of publication
Publication date: 2024-01-15

Full publication date if available
Authors: Ali Farsiabi, Hamid Ebrahimzad, Masoud Ardakani, Chuandong Li

List of authors in order
Landing page: https://arxiv.org/abs/2401.07433

Publisher landing page
PDF URL: https://arxiv.org/pdf/2401.07433

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://arxiv.org/pdf/2401.07433

Direct OA link when available
Concepts: Decoding methods, List decoding, Sequential decoding, Computer science, Binary number, Algorithm, Berlekamp–Welch algorithm, Arithmetic, Mathematics, Concatenated error correction code, Block code

Top concepts (fields/topics) attached by OpenAlex
Cited by: 0

Total citation count in OpenAlex
Related works (count): 10

Other works algorithmically related by OpenAlex

Full payload

id	https://openalex.org/W4390962227
doi	https://doi.org/10.48550/arxiv.2401.07433
ids.doi	https://doi.org/10.48550/arxiv.2401.07433
ids.openalex	https://openalex.org/W4390962227
fwci
type	preprint
title	Fast Successive-Cancellation Decoding of 2 x 2 Kernel Non-Binary Polar Codes: Identification, Decoding and Simplification
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
topics[0].id	https://openalex.org/T11321
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9973999857902527
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1705
topics[0].subfield.display_name	Computer Networks and Communications
topics[0].display_name	Error Correcting Code Techniques
topics[1].id	https://openalex.org/T11130
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.986299991607666
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1702
topics[1].subfield.display_name	Artificial Intelligence
topics[1].display_name	Coding theory and cryptography
topics[2].id	https://openalex.org/T10125
topics[2].field.id	https://openalex.org/fields/22
topics[2].field.display_name	Engineering
topics[2].score	0.9833999872207642
topics[2].domain.id	https://openalex.org/domains/3
topics[2].domain.display_name	Physical Sciences
topics[2].subfield.id	https://openalex.org/subfields/2208
topics[2].subfield.display_name	Electrical and Electronic Engineering
topics[2].display_name	Advanced Wireless Communication Techniques
is_xpac	False
apc_list
apc_paid
concepts[0].id	https://openalex.org/C57273362
concepts[0].level	2
concepts[0].score	0.9117637276649475
concepts[0].wikidata	https://www.wikidata.org/wiki/Q576722
concepts[0].display_name	Decoding methods
concepts[1].id	https://openalex.org/C204397858
concepts[1].level	5
concepts[1].score	0.7883113622665405
concepts[1].wikidata	https://www.wikidata.org/wiki/Q4437907
concepts[1].display_name	List decoding
concepts[2].id	https://openalex.org/C193969084
concepts[2].level	4
concepts[2].score	0.7320908308029175
concepts[2].wikidata	https://www.wikidata.org/wiki/Q7452500
concepts[2].display_name	Sequential decoding
concepts[3].id	https://openalex.org/C41008148
concepts[3].level	0
concepts[3].score	0.6754932999610901
concepts[3].wikidata	https://www.wikidata.org/wiki/Q21198
concepts[3].display_name	Computer science
concepts[4].id	https://openalex.org/C48372109
concepts[4].level	2
concepts[4].score	0.6006141304969788
concepts[4].wikidata	https://www.wikidata.org/wiki/Q3913
concepts[4].display_name	Binary number
concepts[5].id	https://openalex.org/C11413529
concepts[5].level	1
concepts[5].score	0.5756096839904785
concepts[5].wikidata	https://www.wikidata.org/wiki/Q8366
concepts[5].display_name	Algorithm
concepts[6].id	https://openalex.org/C132727834
concepts[6].level	5
concepts[6].score	0.5073866248130798
concepts[6].wikidata	https://www.wikidata.org/wiki/Q4892328
concepts[6].display_name	Berlekamp–Welch algorithm
concepts[7].id	https://openalex.org/C94375191
concepts[7].level	1
concepts[7].score	0.31741946935653687
concepts[7].wikidata	https://www.wikidata.org/wiki/Q11205
concepts[7].display_name	Arithmetic
concepts[8].id	https://openalex.org/C33923547
concepts[8].level	0
concepts[8].score	0.2315044403076172
concepts[8].wikidata	https://www.wikidata.org/wiki/Q395
concepts[8].display_name	Mathematics
concepts[9].id	https://openalex.org/C78944582
concepts[9].level	4
concepts[9].score	0.1897439956665039
concepts[9].wikidata	https://www.wikidata.org/wiki/Q5158264
concepts[9].display_name	Concatenated error correction code
concepts[10].id	https://openalex.org/C157125643
concepts[10].level	3
concepts[10].score	0.10863286256790161
concepts[10].wikidata	https://www.wikidata.org/wiki/Q884707
concepts[10].display_name	Block code
keywords[0].id	https://openalex.org/keywords/decoding-methods
keywords[0].score	0.9117637276649475
keywords[0].display_name	Decoding methods
keywords[1].id	https://openalex.org/keywords/list-decoding
keywords[1].score	0.7883113622665405
keywords[1].display_name	List decoding
keywords[2].id	https://openalex.org/keywords/sequential-decoding
keywords[2].score	0.7320908308029175
keywords[2].display_name	Sequential decoding
keywords[3].id	https://openalex.org/keywords/computer-science
keywords[3].score	0.6754932999610901
keywords[3].display_name	Computer science
keywords[4].id	https://openalex.org/keywords/binary-number
keywords[4].score	0.6006141304969788
keywords[4].display_name	Binary number
keywords[5].id	https://openalex.org/keywords/algorithm
keywords[5].score	0.5756096839904785
keywords[5].display_name	Algorithm
keywords[6].id	https://openalex.org/keywords/berlekamp–welch-algorithm
keywords[6].score	0.5073866248130798
keywords[6].display_name	Berlekamp–Welch algorithm
keywords[7].id	https://openalex.org/keywords/arithmetic
keywords[7].score	0.31741946935653687
keywords[7].display_name	Arithmetic
keywords[8].id	https://openalex.org/keywords/mathematics
keywords[8].score	0.2315044403076172
keywords[8].display_name	Mathematics
keywords[9].id	https://openalex.org/keywords/concatenated-error-correction-code
keywords[9].score	0.1897439956665039
keywords[9].display_name	Concatenated error correction code
keywords[10].id	https://openalex.org/keywords/block-code
keywords[10].score	0.10863286256790161
keywords[10].display_name	Block code
language	en
locations[0].id	pmh:oai:arXiv.org:2401.07433
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400194
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	True
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	arXiv (Cornell University)
locations[0].source.host_organization	https://openalex.org/I205783295
locations[0].source.host_organization_name	Cornell University
locations[0].source.host_organization_lineage	https://openalex.org/I205783295
locations[0].license
locations[0].pdf_url	https://arxiv.org/pdf/2401.07433
locations[0].version	submittedVersion
locations[0].raw_type	text
locations[0].license_id
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	http://arxiv.org/abs/2401.07433
locations[1].id	doi:10.48550/arxiv.2401.07433
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400194
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	True
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	arXiv (Cornell University)
locations[1].source.host_organization	https://openalex.org/I205783295
locations[1].source.host_organization_name	Cornell University
locations[1].source.host_organization_lineage	https://openalex.org/I205783295
locations[1].license	cc-by
locations[1].pdf_url
locations[1].version
locations[1].raw_type	article
locations[1].license_id	https://openalex.org/licenses/cc-by
locations[1].is_accepted	False
locations[1].is_published
locations[1].raw_source_name
locations[1].landing_page_url	https://doi.org/10.48550/arxiv.2401.07433
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5004354664
authorships[0].author.orcid	https://orcid.org/0000-0001-9279-6066
authorships[0].author.display_name	Ali Farsiabi
authorships[0].author_position	first
authorships[0].raw_author_name	Farsiabi, Ali
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5052730838
authorships[1].author.orcid	https://orcid.org/0009-0009-0740-1986
authorships[1].author.display_name	Hamid Ebrahimzad
authorships[1].author_position	middle
authorships[1].raw_author_name	Ebrahimzad, Hamid
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5008826983
authorships[2].author.orcid
authorships[2].author.display_name	Masoud Ardakani
authorships[2].author_position	middle
authorships[2].raw_author_name	Ardakani, Masoud
authorships[2].is_corresponding	False
authorships[3].author.id	https://openalex.org/A5004761966
authorships[3].author.orcid	https://orcid.org/0000-0001-6155-4849
authorships[3].author.display_name	Chuandong Li
authorships[3].author_position	last
authorships[3].raw_author_name	Li, Chuandong
authorships[3].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://arxiv.org/pdf/2401.07433
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2024-01-18T00:00:00
display_name	Fast Successive-Cancellation Decoding of 2 x 2 Kernel Non-Binary Polar Codes: Identification, Decoding and Simplification
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T06:51:31.235846
primary_topic.id	https://openalex.org/T11321
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9973999857902527
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1705
primary_topic.subfield.display_name	Computer Networks and Communications
primary_topic.display_name	Error Correcting Code Techniques
related_works	https://openalex.org/W2385322349, https://openalex.org/W2369600518, https://openalex.org/W2370284973, https://openalex.org/W2357077655, https://openalex.org/W2351361564, https://openalex.org/W2144831582, https://openalex.org/W2129423808, https://openalex.org/W4205451769, https://openalex.org/W1976480044, https://openalex.org/W2488124294
cited_by_count	0
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2401.07433
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400194
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	arXiv (Cornell University)
best_oa_location.source.host_organization	https://openalex.org/I205783295
best_oa_location.source.host_organization_name	Cornell University
best_oa_location.source.host_organization_lineage	https://openalex.org/I205783295
best_oa_location.license
best_oa_location.pdf_url	https://arxiv.org/pdf/2401.07433
best_oa_location.version	submittedVersion
best_oa_location.raw_type	text
best_oa_location.license_id
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	http://arxiv.org/abs/2401.07433
primary_location.id	pmh:oai:arXiv.org:2401.07433
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400194
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	True
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	arXiv (Cornell University)
primary_location.source.host_organization	https://openalex.org/I205783295
primary_location.source.host_organization_name	Cornell University
primary_location.source.host_organization_lineage	https://openalex.org/I205783295
primary_location.license
primary_location.pdf_url	https://arxiv.org/pdf/2401.07433
primary_location.version	submittedVersion
primary_location.raw_type	text
primary_location.license_id
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	http://arxiv.org/abs/2401.07433
publication_date	2024-01-15
publication_year	2024
referenced_works_count	0
abstract_inverted_index.2	87, 89
abstract_inverted_index.a	134
abstract_inverted_index.x	88
abstract_inverted_index.In	74, 91
abstract_inverted_index.SC	26, 80, 101, 129, 145, 166, 174
abstract_inverted_index.We	131
abstract_inverted_index.an	155
abstract_inverted_index.by	5, 50
abstract_inverted_index.in	35, 99, 161
abstract_inverted_index.is	65, 169
abstract_inverted_index.it	45
abstract_inverted_index.no	179
abstract_inverted_index.of	41, 53, 61, 104, 142, 157
abstract_inverted_index.on	63, 86
abstract_inverted_index.to	15, 22, 67, 127, 159
abstract_inverted_index.up	158
abstract_inverted_index.we	77, 93, 113, 153
abstract_inverted_index.95%	160
abstract_inverted_index.Due	21
abstract_inverted_index.The	32
abstract_inverted_index.and	44, 71, 106, 120
abstract_inverted_index.for	82, 176
abstract_inverted_index.has	37, 46
abstract_inverted_index.our	148, 171
abstract_inverted_index.the	16, 23, 39, 51, 58, 100, 116, 123, 140, 164
abstract_inverted_index.(SC)	8
abstract_inverted_index.BPCs	36
abstract_inverted_index.NBPC	136
abstract_inverted_index.This	111, 168
abstract_inverted_index.also	132
abstract_inverted_index.been	38, 47
abstract_inverted_index.fast	54, 79, 109, 144, 150, 173
abstract_inverted_index.from	29
abstract_inverted_index.full	117
abstract_inverted_index.have	10
abstract_inverted_index.that	138
abstract_inverted_index.this	75
abstract_inverted_index.tree	103, 119
abstract_inverted_index.vast	59
abstract_inverted_index.way,	112
abstract_inverted_index.NBPCs	64, 83, 105, 177
abstract_inverted_index.Using	147
abstract_inverted_index.avoid	114
abstract_inverted_index.based	85
abstract_inverted_index.codes	2, 19
abstract_inverted_index.delay	125
abstract_inverted_index.issue	34
abstract_inverted_index.large	30
abstract_inverted_index.loss.	181
abstract_inverted_index.nodes	98
abstract_inverted_index.polar	1, 18
abstract_inverted_index.their	108
abstract_inverted_index.topic	40
abstract_inverted_index.while	170
abstract_inverted_index.binary	17
abstract_inverted_index.design	70
abstract_inverted_index.incurs	178
abstract_inverted_index.issues	68
abstract_inverted_index.paper,	76
abstract_inverted_index.reduce	122
abstract_inverted_index.serial	24
abstract_inverted_index.(BPCs).	20
abstract_inverted_index.(NBPCs)	3
abstract_inverted_index.decoded	4
abstract_inverted_index.decoder	175
abstract_inverted_index.devoted	66
abstract_inverted_index.latency	33, 162
abstract_inverted_index.nature,	25
abstract_inverted_index.notably	48
abstract_inverted_index.propose	78, 107, 133
abstract_inverted_index.special	97
abstract_inverted_index.suffers	28
abstract_inverted_index.various	95
abstract_inverted_index.However,	57
abstract_inverted_index.SC-based	55
abstract_inverted_index.compared	14, 126
abstract_inverted_index.decoder,	152
abstract_inverted_index.decoding	27, 81, 102, 118, 124
abstract_inverted_index.identify	94
abstract_inverted_index.kernels.	90
abstract_inverted_index.latency.	31
abstract_inverted_index.majority	60
abstract_inverted_index.observed	154
abstract_inverted_index.original	165
abstract_inverted_index.proposed	149, 172
abstract_inverted_index.research	43, 62
abstract_inverted_index.resolved	49
abstract_inverted_index.algorithm	9
abstract_inverted_index.decoders.	56
abstract_inverted_index.decoding.	110, 130, 146, 167
abstract_inverted_index.efficient	72
abstract_inverted_index.extensive	42
abstract_inverted_index.procedure	141
abstract_inverted_index.structure	137
abstract_inverted_index.Non-binary	0
abstract_inverted_index.concerning	69, 163
abstract_inverted_index.error-rate	180
abstract_inverted_index.non-binary	96, 143, 151
abstract_inverted_index.remarkable	11
abstract_inverted_index.simplified	135
abstract_inverted_index.successive	6
abstract_inverted_index.traversing	115
abstract_inverted_index.constructed	84
abstract_inverted_index.facilitates	139
abstract_inverted_index.improvement	156
abstract_inverted_index.particular,	92
abstract_inverted_index.performance	13
abstract_inverted_index.cancellation	7
abstract_inverted_index.introduction	52
abstract_inverted_index.significantly	121
abstract_inverted_index.bit-error-rate	12
abstract_inverted_index.implementation.	73
abstract_inverted_index.symbol-by-symbol	128
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	4
citation_normalized_percentile