Options
Memory-Assisted Quantized LDPC Decoding
Citation Link: https://doi.org/10.15480/882.13278
Publikationstyp
Journal Article
Date Issued
2025-02-10
Sprache
English
TORE-DOI
Journal
Volume
29
Issue
5
Start Page
888
End Page
892
Citation
IEEE Communications Letters 29 (5): 888-892 (2025)
Publisher DOI
Scopus ID
ArXiv ID
Publisher
IEEE
Peer Reviewed
false
We enhance coarsely quantized LDPC decoding by reusing computed check node messages from previous iterations. Typically, variable and check nodes update and replace old messages every iteration. We show that, under coarse quantization, discarding old messages entails a significant loss of mutual information. The loss is avoided with additional memory, improving performance by up to 0.23 dB. We optimize quantization with a modified information bottleneck algorithm that considers the statistics of old messages. A simple merge operation reduces memory requirements. Depending on channel conditions and code rate, memory assistance enables up to 32% better area efficiency for 2-bit decoding.
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