Check node update method suitable for multi-ary LDPC (Low Density Parity Check)

Abstract

The invention provides a check node update method suitable for a multi-ary LDPC (Low Density Parity Check), and belongs to the technical field of channel encoding and decoding. The method comprises the following steps: converting a V2C soft message to a delta domain, selecting a minimum value and a second minimum value of each row from the delta domain, and storing positions of the minimum value and the second minimum value in the first iteration; enabling the selected minimum value and the second minimum value to constitute two configurations, and respectively generating a first additional column and a second additional column, wherein the value of the first additional column is used for updating a C2V value of other positions except the position where the minimum V2C value is located, and the value of the second additional column is used for updating the C2V value on the position of the minimum V2C value; converting the obtained C2V value to a common domain; and in subsequent iterations, comparing the two V2C values at the two saved positions in the first iteration and selecting a smaller value to use. According to the check node update method suitable for the multi-ary LDPC provided by the invention, through the mode that the minimum value and the double additional columns are selected at the fixed positions, on the premise that the performance is basically not lost, the calculation complexity is greatly reduced, the hardware expenditure is reduced, and the cost is reduced.

Description

technical field [0001] The invention relates to the technical field of channel coding and decoding, in particular to a check node update method suitable for multi-ary LDPC codes. Background technique [0002] Channel coding is a key technology to ensure reliable operation of communication systems and storage systems. LDPC (Binary Low Density Parity Check Code) is a kind of linear error correction code whose performance can approach Shannon's limit. In the past ten years, binary LDPC codes have been developed rapidly and widely used in communication and data transmission systems. Multi-ary LDPC codes can exhibit better error correction capability than binary LDPC codes, have a lower error floor and are highly suitable for high-order modulation. [0003] There are many decoding algorithms for multi-ary LDPC codes, which can be summarized into two categories: hard decision and soft decision. Among them, although the hard decision algorithm is simple to implement, its perform...

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a check node update method suitable for multi-ary LDPC codes, so as to solve the problems of many calculation times, complex calculation, large resource consumption and high cost in the existing check node update method

Images