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

Non-uniform message quantization techniques such asreconstruction-computation-quantization (RCQ) improve error-correctionperformance and decrease hardware complexity of low-density parity-check (LDPC)decoders that use a flooding schedule. Layered MinSum RCQ (L-msRCQ) enablesmessage quantization to be utilized for layered decoders and irregular LDPCcodes. We investigate field-programmable gate array (FPGA) implementations ofL-msRCQ decoders. Three design methods for message quantization are presented,which we name the Lookup, Broadcast, and Dribble methods. The decodingperformance and hardware complexity of these schemes are compared to a layeredoffset MinSum (OMS) decoder. Simulation results on a (16384, 8192)protograph-based raptor-like (PBRL) LDPC code show that a 4-bit L-msRCQ decoderusing the Broadcast method can achieve a 0.03 dB improvement inerror-correction performance while using 12% fewer registers than the OMSdecoder. A Broadcast-based 3-bit L-msRCQ decoder uses 15% fewer lookup tables,18% fewer registers, and 13% fewer routed nets than the OMS decoder, butresults in a 0.09 dB loss in performance.

FPGA Implementations of Layered MinSum LDPC Decoders Using RCQ Message Passing