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

Recursive projection aggregation (RPA) decoding as introduced in [1] is anovel decoding algorithm which performs close to the maximum likelihood decoderfor short-length Reed-Muller codes. Recently, an extension to RPA decoding,called sparse multi-decoder RPA (SRPA), has been proposed [2]. The SRPAapproach makes use of multiple pruned RPA decoders to lower the amount ofcomputations while keeping the performance loss small compared to RPA decoding.However, the use of multiple sparse decoders again increases the computationalburden. Therefore, the focus is on the optimization of sparse single-decoderRPA decoding to keep the complexity small. In this paper, a novel method isproposed, to select subsets of subspaces used in the projection and aggregationstep of SRPA decoding in order to decrease the decoding error probability onAWGN channels. The proposed method replaces the random selection of subspacesubsets with a semi-deterministic selection method based on a figure of meritthat evaluates the performance of each subspace. Our simulation results showthat the semi-deterministic subspace selection improves the decodingperformance up to $0.2\,\text{dB}$ compared to SRPA. At the same time, thecomplexity of SRPA decoding for RM codes of order $r\geq 3$ is reduced by up to81% compared to SRPA.

Semi-Deterministic Subspace Selection for Sparse Recursive Projection-Aggregation Decoding of Reed-Muller Codes