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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Science China. Information sciences Ročník 66; číslo 5; s. 152301
Hlavní autoři: Wu, Yunzhi, Li, Li, Fan, Pingzhi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Science China Press 01.05.2023
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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