A Low-complexity Column Hierarchical LDPC Decoder Implementation Method

Abstract

A low-complexity column layered LDPC decoder implementation method, which adopts an efficient outer information compression and storage method on the basis of conventional LDPC layered decoding and compensates for the minimum and sub-minimum values ​​of the loss. , in the decoding process, each check node only needs to store the information tuples consisting of the minimum value and the second smallest value of the external information, which effectively reduces the storage resource requirements of the decoder for external information during the decoding process, and greatly reduces the The number of comparisons and replacements required for compressing storage computing is reduced, and the method can maintain excellent decoding performance while reducing storage and computing resources.

Description

Technical field [0001] The invention relates to a low-complexity column-layered LDPC decoder realization method, which belongs to the field of communication channel decoding. Background technique [0002] The decoding algorithm of LDPC codes usually adopts the flood information transmission strategy. In each iteration, the message update of all variable nodes and check nodes is carried out in parallel. In the case of the flood information transmission strategy, for the M×N-dimensional LDPC Code, node information update requires M-channel check node processing unit and N-channel variable node processing unit to work in parallel, and each node information processed by the node processing unit uses the result of the previous iteration. Take d c Indicates the degree of the check node in the matrix, d v Represents the degree of the variable node, this method requires parallel d v Update the check node, each path requires calculation of d c The minimum and the second smallest value of ...

AI Technical Summary

Problems solved by technology

Aiming at this defect, a simplified decoding algorithm named Col-Layer-3min is proposed, which updates the d required by each check node c One extrinsic information storage unit is reduced to two extrinsic information triplets, which can effectively reduce the hardware resources required for extrinsic information storage in the decoding implementation process when the decoding loss is very low. Introduces an additional triple comparison update calculation, which increases the amount of mathematical calculations in the decoding process to a certain extent

Images