Results 61 to 70 of about 190 (145)

An Error Segment Bit-Flip Algorithm for Successive Cancellation List Decoding of Polar Codes

Mathematics
Polar codes have garnered significant attention since they were proposed due to their capacity-achieving properties and their low-complexity decoding process, and they were selected as the coding scheme for the control channel in 5G mobile communication ...
Jing Zhang, Hongbing Qiu, Ling Zhan, Lili Chen   +3 more
doaj   +1 more source

Partitioned Successive-Cancellation List Flip Decoding of Polar Codes

2024 IEEE Workshop on Signal Processing Systems (SiPS)
6 pages, 7 figures, 1 table, Accepted in IEEE SIPS ...
Charles Pillet, Ilshat Sagitov, Grégoire Domer, Pascal Giard   +3 more
openaire   +2 more sources

Improved Adaptive Successive Cancellation List Decoding of Polar Codes [PDF]

Entropy (Basel), 2019
Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result ...
Wang X, He J, Li J, Wu Z, Shan L, Hong B.   +5 more
europepmc   +4 more sources

Automorphism Set Construction for Automorphism Ensemble Decoding With Reduced Delay

IEEE Open Journal of the Communications Society
The anticipated demands of 6G ultra-reliable low-latency communications (URLLC) call for near-instantaneous data transfers and error-correction efficiency rivaling maximum-likelihood (ML) decoding. Achieving an effective compromise between latency, power
Anna Fominykh, Kirill Shabunov
doaj   +1 more source

Successive Cancellation List Decoding of Extended Reed-Solomon Codes

CoRR
Reed-Solomon (RS) codes are an important class of non-binary error-correction codes. They are particularly competent in correcting burst errors, being widely applied in modern communications and data storage systems. This also thanks to their distance property of reaching the Singleton bound, being the maximum distance separable (MDS) codes. This paper
Xiaoqian Ye, Jingyu Lin, Junjie Huang, Li Chen 0013, Chang-An Zhao   +4 more
openaire   +2 more sources

Intelligent Path-Selection-Aided Decoding of Polar Codes. [PDF]

Entropy (Basel), 2023
Cui H, Niu K, Zhong S.
europepmc   +1 more source

Joint Design of Polar Coding and Physical Network Coding for Two-User Downlink Non-Orthogonal Multiple Access. [PDF]

Entropy (Basel), 2023
Xie Z, Chen P, Li Y.
europepmc   +1 more source

Pre-Configured Error Pattern Ordered Statistics Decoding for CRC-Polar Codes. [PDF]

Entropy (Basel), 2023
Li X, Niu K, Han Y, Dai J, Tan Z, Guo Z.
europepmc   +1 more source

SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach. [PDF]

Entropy (Basel), 2022
Rowshan M, Viterbo E.
europepmc   +1 more source

On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes

Journal of Signal Processing Systems
The recently proposed SCLF decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SCL decoding. However, it comes at the cost of a higher complexity. In this paper, partitioned polar codes tailored for the proposed PSCLF decoding algorithm are used to reduce the complexity of SCLF.
Charles Pillet, Ilshat Sagitov, Pascal Giard   +2 more
openaire   +2 more sources