Region-Specific Coarse Quantization With Check Node Awareness in 5G LDPC Decoding
Uloženo v:
| Název: | Region-Specific Coarse Quantization With Check Node Awareness in 5G LDPC Decoding |
|---|---|
| Autoři: | Mohr, Philipp, Bauch, Gerhard |
| Zdroj: | IEEE Transactions on Communications. 73:6976-6992 |
| Publication Status: | Preprint |
| Informace o vydavateli: | Institute of Electrical and Electronics Engineers (IEEE), 2025. |
| Rok vydání: | 2025 |
| Témata: | FOS: Computer and information sciences, Computer Science, Information and General Works::004: Computer Sciences, Information Theory (cs.IT), rate-compatible, Information Theory, information bottleneck, Natural Sciences and Mathematics::519: Applied Mathematics, Probabilities, coarse quantization, LDPC decoding, layered schedule, cs.IT, math.IT, Technology::621: Applied Physics, 5G |
| Popis: | This paper presents novel techniques for improving the error correction performance and reducing the complexity of coarsely quantized 5G-LDPC decoders. The proposed decoder design supports arbitrary message-passing schedules on a base-matrix level by modeling exchanged messages with entry-specific discrete random variables. Variable nodes (VNs) and check nodes (CNs) involve compression operations designed using the information bottleneck method to maximize preserved mutual information between code bits and quantized messages. We introduce alignment regions that assign the messages to groups with aligned reliability levels to decrease the number of individual design parameters. Group compositions with degree-specific separation of messages improve performance by up to 0.4 dB. Further, we generalize our recently proposed CN-aware quantizer design to irregular LDPC codes and layered schedules. The method optimizes the VN quantizer to maximize preserved mutual information at the output of the subsequent CN update, enhancing performance by up to 0.2 dB. A schedule optimization modifies the order of layer updates, reducing the average iteration count by up to 35%. We integrate all new techniques in a rate-compatible decoder design by extending the alignment regions along a rate-dimension. Our complexity analysis shows that 2-bit decoding can double the area efficiency over 4-bit decoding at comparable performance. This paper has been submitted to IEEE Transactions on Communications |
| Druh dokumentu: | Article |
| ISSN: | 1558-0857 0090-6778 |
| DOI: | 10.1109/tcomm.2025.3541036 |
| DOI: | 10.48550/arxiv.2406.14233 |
| DOI: | 10.15480/882.13246 |
| Přístupová URL adresa: | http://arxiv.org/abs/2406.14233 |
| Rights: | IEEE Copyright CC BY |
| Přístupové číslo: | edsair.doi.dedup.....7f92de023934b75cee91a69aaf855f18 |
| Databáze: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | This paper presents novel techniques for improving the error correction performance and reducing the complexity of coarsely quantized 5G-LDPC decoders. The proposed decoder design supports arbitrary message-passing schedules on a base-matrix level by modeling exchanged messages with entry-specific discrete random variables. Variable nodes (VNs) and check nodes (CNs) involve compression operations designed using the information bottleneck method to maximize preserved mutual information between code bits and quantized messages. We introduce alignment regions that assign the messages to groups with aligned reliability levels to decrease the number of individual design parameters. Group compositions with degree-specific separation of messages improve performance by up to 0.4 dB. Further, we generalize our recently proposed CN-aware quantizer design to irregular LDPC codes and layered schedules. The method optimizes the VN quantizer to maximize preserved mutual information at the output of the subsequent CN update, enhancing performance by up to 0.2 dB. A schedule optimization modifies the order of layer updates, reducing the average iteration count by up to 35%. We integrate all new techniques in a rate-compatible decoder design by extending the alignment regions along a rate-dimension. Our complexity analysis shows that 2-bit decoding can double the area efficiency over 4-bit decoding at comparable performance.<br />This paper has been submitted to IEEE Transactions on Communications |
|---|---|
| ISSN: | 15580857 00906778 |
| DOI: | 10.1109/tcomm.2025.3541036 |