A fast parallel SC-Fano decoding algorithm for PAC codes

In order to effectively reduce the “decoding latency” of successive cancellation decoding aided Fano (SC-Fano) decoder employed in polarization-adjusted convolutional (PAC) codes, a fast parallel SC-Fano decoding algorithm is designed, which leverages multiple individual decoding components. Critica...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences Vol. 66; no. 5; p. 152301
Main Authors: Wu, Yunzhi, Li, Li, Fan, Pingzhi
Format: Journal Article
Language:English
Published: Beijing Science China Press 01.05.2023
Springer Nature B.V
Subjects:
Algorithms
Codes
Computer Science
Convolutional codes
Decoders
Decoding
Information Systems and Communication Service
Performance degradation
Research Paper
complexity
PAC codes
parallel decoding
Fano decoding
ISSN:1674-733X, 1869-1919
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to effectively reduce the “decoding latency” of successive cancellation decoding aided Fano (SC-Fano) decoder employed in polarization-adjusted convolutional (PAC) codes, a fast parallel SC-Fano decoding algorithm is designed, which leverages multiple individual decoding components. Critical challenges arise from how to appropriately initialize the thresholds of different SC-Fano decoding components and how will these decoding components cooperate with each other. After appropriately overcoming these challenges, our design is capable of halving the “decoding latency” without incurring any noticeable frame error rate (FER) performance degradation, meanwhile, the overall computational complexity is normally constrained below one and a half times of that required by conventional SC-Fano decoders in simulated typical configurations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-022-3498-8