Options
Memory-Assisted Quantized LDPC Decoding
Citation Link: https://doi.org/10.15480/882.13278
Publikationstyp
Preprint
Date Issued
2024-08-14
Sprache
English
TORE-DOI
Citation
arXiv: 2408.07437 (2024)
Publisher DOI
Scopus ID
ArXiv ID
Peer Reviewed
false
We enhance coarsely quantized LDPC decoding by reusing computed check node
messages from previous iterations. Typically, variable and check nodes generate
and replace old messages in every iteration. We show that, under coarse
quantization, discarding old messages involves a significant loss of mutual
information. The loss is avoided with additional memory, improving performance
up to 0.36 dB. We propose a modified information bottleneck algorithm to design
node operations taking messages from the previous iteration(s) into account as
side information. Finally, we reveal a 2-bit row-layered decoder that can
operate within 0.25 dB w.r.t. 32-bit belief propagation.
messages from previous iterations. Typically, variable and check nodes generate
and replace old messages in every iteration. We show that, under coarse
quantization, discarding old messages involves a significant loss of mutual
information. The loss is avoided with additional memory, improving performance
up to 0.36 dB. We propose a modified information bottleneck algorithm to design
node operations taking messages from the previous iteration(s) into account as
side information. Finally, we reveal a 2-bit row-layered decoder that can
operate within 0.25 dB w.r.t. 32-bit belief propagation.
Subjects
cs.IT
math.IT
LDPC decoding
layered schedule
5G
coarse quantization
information bottleneck
message reusage
DDC Class
621: Applied Physics
004: Computer Sciences
519: Applied Mathematics, Probabilities
Publication version
submittedVersion
Loading...
Name
draft_Memory Assisted LDPC - Mohr -v2.pdf
Type
Main Article
Size
560.36 KB
Format
Adobe PDF