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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this work, we introduce &#x03B2;-expansion, a notion borrowed from number theory, as a theoretical framework to study fast construction of polar codes based on a recursive structure of universal partial order (UPO) and polarization weight (PW) algorithm. We show that polar codes can be recursively constructed from UPO by continuously solving several polynomial equations at each recursive step. From these polynomial equations, we can extract an interval for &#x03B2;, such that ranking the synthetic channels through a closed- form &#x03B2;-expansion preserves the property of nested frozen sets, which is a desired feature for low- complex construction. In an example of AWGN channels, we show that this interval for &#x03B2; converges to a constant close to 1.1892 when the code block-length trends to infinity. Both asymptotic analysis and simulation results validate our theoretical claims.

Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes