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 paper, we consider the performance of the Noisy Gradient Descent BitFlipping (NGDBF) algorithm under re-decoding of failed frames. NGDBF is arecent algorithm that uses a non-deterministic gradient descent search todecode low-density parity check (LDPC) codes. The proposed re-decode procedureobtains improved performance because the perturbations are independent at eachre-decoding phase, therefore increasing the likelihood of successful decoding.We examine the benefits of re-decoding for an LDPC code from the IEEE 802.3anstandard, and find that only a small fraction of re-decoded frames are neededto obtain significant performance benefits. When re-decoding is used, the NGDBFperformance is very close to a benchmark offset min-sum decoder for the 802.3ancode.

Decoding LDPC codes via Noisy Gradient Descent Bit-Flipping with Re-Decoding