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 represent one of the major recent breakthroughs in coding theoryand, because of their attractive features, they have been selected for theincoming 5G standard. As such, a lot of attention has been devoted to thedevelopment of decoding algorithms with good error performance and efficienthardware implementation. One of the leading candidates in this regard isrepresented by successive-cancellation list (SCL) decoding. However, itshardware implementation requires a large amount of memory. Recently, apartitioned SCL (PSCL) decoder has been proposed to significantly reduce thememory consumption. In this paper, we examine the paradigm of PSCL decodingfrom both theoretical and practical standpoints: (i) by changing theconstruction of the code, we are able to improve the performance at noadditional computational, latency or memory cost, (ii) we present an optimalscheme to allocate cyclic redundancy checks (CRCs), and (iii) we provide anupper bound on the list size that allows MAP performance.

Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance