Mohr, PhilippPhilippMohrBauch, GerhardGerhardBauch2023-01-162023-01-162022-12IEEE Global Communications Conference (GLOBECOM 2022) 3484-3489http://hdl.handle.net/11420/14584For improving coarsely quantized decoding of LDPC codes, we propose a check node aware design of the variable node update. In contrast to previous works, we optimize the variable node to explicitly maximize the mutual information preserved in the check-to-variable instead of the variable-to-check node messages. The extended optimization leads to a significantly different solution for the compression operation at the variable node. Simulation results for regular LDPC codes confirm that the check node aware design, especially for very coarse quantization with 2- or 3-bit messages, achieves performance gains of up to 0.2 dB - without additional hardware costs. We also show that the 2-bit message resolution enables a very efficient implementation of the check node update, which requires only 2/9 of the 3-bit check node's transistor count and reduces the signal propagation delay by a factor of 4.enhttps://creativecommons.org/licenses/by/4.0/Computer Science - Information TheoryMathematics - Information TheoryComputer Science, Information and General Works::004: Computer SciencesNatural Sciences and Mathematics::510: MathematicsConference Paperhttps://doi.org/10.15480/882.1397910.48550/arXiv.2211.0697310.1109/GLOBECOM48099.2022.1000066510.15480/882.139792211.06973v1Conference Paper