English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Polar codes under cyclic redundancy check aided successive cancellation list(CA-SCL) decoding can outperform the turbo codes and the LDPC codes when codelengths are configured to be several kilobits. In order to reduce the decodingcomplexity, a novel tree-pruning scheme for the \mbox{SCL/CA-SCL} decodingalgorithms is proposed in this paper. In each step of the decoding procedure,the candidate paths with metrics less than a threshold are dropped directly toavoid the unnecessary computations for the path searching on the descendantbranches of them. Given a candidate path, an upper bound of the path metric ofits descendants is proposed to determined whether the pruning of this candidatepath would affect frame error rate (FER) performance. By utilizing this upperbounding technique and introducing a dynamic threshold, the proposed schemedeletes the redundant candidate paths as many as possible while keeping theperformance deterioration in a tolerant region, thus it is much more efficientthan the existing pruning scheme. With only a negligible loss of FERperformance, the computational complexity of the proposed pruned decodingscheme is only about $40\%$ of the standard algorithm in the lowsignal-to-noise ratio (SNR) region (where the FER under CA-SCL decoding isabout $0.1 \sim 0.001$), and it can be very close to that of the successivecancellation (SC) decoder in the moderate and high SNR regions.

Reduce the Complexity of List Decoding of Polar Codes by Tree-Pruning