Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method

The complexity of belief propagation algorithms for decoding LDPC codes can be significantly reduced by storing the precomputed sum of messages in variable nodes. This optimization is particularly useful for layered schedule decoders, where it also simplifies the hardware implementation. To reduce t...

Full description

Saved in:
Bibliographic Details
Published in:Problems of information transmission Vol. 60; no. 3; pp. 199 - 208
Main Authors: Melnikov, I. A., Uglovskii, A. Yu, Kreshchuk, A. A., Kureev, A. A., Khorov, E. M.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.09.2024
Springer Nature B.V
Subjects:
639/301/1034/1035
639/925/357/995
Algorithms
Codes
Coding Theory
Communications Engineering
Complexity
Control
Decoders
Decoding
Electrical Engineering
Engineering
Information Storage and Retrieval
Lookup tables
Low density parity check codes
Messages
Networks
Nodes
Random variables
Subtraction
Sums
Systems Theory
sequential decoding
belief propagation algorithm
iterative decoding
low-density parity-check (LDPC) codes
information bottleneck method
ISSN:0032-9460, 1608-3253
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The complexity of belief propagation algorithms for decoding LDPC codes can be significantly reduced by storing the precomputed sum of messages in variable nodes. This optimization is particularly useful for layered schedule decoders, where it also simplifies the hardware implementation. To reduce the requirement for the amount of information to be processed during decoding, the information bottleneck method is used, which reduces the bit width of all updated messages. However, under this approach, re-calculation of the sum when excluding one of messages becomes complicated. The paper is devoted to development of an algorithm for construction of a discrete binary function corresponding to such subtraction. When using this algorithm, the number of stored and used lookup tables for variable nodes is reduced.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0032-9460
1608-3253
DOI:10.1134/S0032946024030049