Results 31 to 40 of about 190 (145)

Complexity Reduction of Polar Decoders Using Adaptive Fast-SSC and Fast-SSCL Algorithms [PDF]

open access: yesEPJ Web of Conferences
In this work, we propose a hybrid decoding approach that dynamically segments the received frame into three subframes based on the distribution of the first decoding errors.
Lamrini Mohamed   +3 more
doaj   +1 more source

Symbol-based successive cancellation list decoder for polar codes [PDF]

open access: yes2014 IEEE Workshop on Signal Processing Systems (SiPS), 2014
Accepted by 2014 IEEE Workshop on Signal Processing Systems (SiPS)
Xiong, Chenrong, Lin, Jun, Yan, Zhiyuan
openaire   +3 more sources

Fast Polar Decoding With Successive Cancellation List Creeper Algorithm

open access: yesIEEE Access, 2023
Polar codes have emerged as a focal point in the field of error-correcting codes, owing to their remarkable capacity-achieving characteristics and their relevance in various modern communication systems. The basic successive cancellation (SC) approach is not optimal to use in terms of the trade-off between performance and decoding complexity.
Ilya Timokhin, Fedor I. Ivanov
openaire   +2 more sources

Soft-In Soft-Out Polar Decoding Aided Three-Stage Concatenated Iterative MIMO-Turbo Transceivers

open access: yesIEEE Open Journal of Vehicular Technology, 2023
A novel Soft-Input Soft-Output (SISO) polar decoding algorithm is proposed, which is capable of iterating between an inner and outer decoder in a three-stage serial concatenated iterative receiver. The proposed polar decoding algorithm leverages a hybrid
Zeynep B. Kaykac Egilmez   +3 more
doaj   +1 more source

Successive Cancellation Priority Decoding of Polar Codes

open access: yesIEEE Access, 2019
The successive cancellation list (SCL) decoding of polar codes can achieve a performance close to that of maximum-likelihood decoding. Nevertheless, a large list size results in high-computational complexity.
Di Guan, Kai Niu, Chao Dong, Ping Zhang
doaj   +1 more source

Error-Aware SCFlip Decoding of Polar Codes

open access: yesIEEE Access, 2020
The successive-cancellation flip (SCFlip) decoder and its variants provide a significant coding gain with the average complexity practically identical to that of the successive cancellation (SC) decoder in a wide range of signal-to-noise ratios (SNRs ...
Daeyeol Yang, Kyeongcheol Yang
doaj   +1 more source

On metric sorting for successive cancellation list decoding of polar codes [PDF]

open access: yes2015 IEEE International Symposium on Circuits and Systems (ISCAS), 2015
To be presented in 2015 IEEE International Symposium on Circuits and Systems (ISCAS'2015)
Alexios Balatsoukas-Stimming   +2 more
openaire   +2 more sources

Segmented Successive Cancellation List Polar Decoding with Tailored CRC [PDF]

open access: yesJournal of Signal Processing Systems, 2019
As the first error correction codes provably achieving the symmetric capacity of binary-input discrete memory-less channels (B-DMCs), polar codes have been recently chosen by 3GPP for eMBB control channel. Among existing algorithms, CRC-aided successive cancellation list (CA-SCL) decoding is favorable due to its good performance, where CRC is placed at
Huayi Zhou 0002   +5 more
openaire   +3 more sources

Efficient Sorting Architecture for List-Fast-SSC Decoding of Polar Codes

open access: yesIEEE Access, 2018
Polar codes have been proven to achieve the symmetric capacity of memoryless channel. Compared with a successive cancellation list decoder, list-Fast simplified-successive cancellation generates more candidate paths, which leads to more resource costs ...
Xiaojun Zhang   +4 more
doaj   +1 more source

An Adaptive Ordered Shifted-Pruning List Decoder for Polar Codes

open access: yesIEEE Access, 2020
The polar code has been selected as a channel coding solution for the control channel of 5th generation wireless systems (5G). Compared with the conventional cyclic-redundancy-check-aided successive cancellation list (CA-SCL) decoder for polar codes, the
Yansong Lv, Hang Yin, Yuhuan Wang
doaj   +1 more source

Home - About - Disclaimer - Privacy