Mohr, PhilippPhilippMohrBauch, GerhardGerhardBauch2024-09-102024-09-102025-02-10IEEE Communications Letters 29 (5): 888-892 (2025)https://hdl.handle.net/11420/49006We 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.en#PLACEHOLDER_PARENT_METADATA_VALUE#20255888892IEEEhttps://creativecommons.org/licenses/by/4.0/cs.ITmath.ITLDPC decodinglayered schedule5Gcoarse quantizationinformation bottleneckmessage reusageTechnology::621: Applied PhysicsComputer Science, Information and General Works::004: Computer SciencesNatural Sciences and Mathematics::519: Applied Mathematics, ProbabilitiesJournal Article10.15480/882.1327810.1109/LCOMM.2025.354027710.15480/882.132782408.07437Journal Article