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

Although the successive cancelation (SC) algorithm works well for very longpolar codes, its error performance for shorter polar codes is much worse.Several SC based list decoding algorithms have been proposed to improve theerror performances of both long and short polar codes. A significant step of SCbased list decoding algorithms is the updating of partial sums for all decodingpaths. In this paper, we first proposed a lazy copy partial sum computationalgorithm for SC based list decoding algorithms. Instead of copying partialsums directly, our lazy copy algorithm copies indices of partial sums. Based onour lazy copy algorithm, we propose a hybrid partial sum computation unitarchitecture, which employs both registers and memories so that the overallarea efficiency is improved. Compared with a recent partial sum computationunit for list decoders, when the list size $L=4$, our partial sum computationunit achieves an area saving of 23\% and 63\% for block length $2^{13}$ and$2^{15}$, respectively.

A hybrid partial sum computation unit architecture for list decoders of polar codes