Variable node multiplexing method of semi-random decoder

Abstract

The invention discloses a variable node multiplexing method of a semi-random decoder, and belongs to the field of channel coding and decoding in wireless communication. The method comprises the following steps: in each clock period, a multiplexer controlled by a counter selecting a variable node from m variable nodes at the same time, recording the variable node as VNi, and calculating confidenceprobability values Pi, 1-Pi and n of the variable node by using a multiplication circuit; after calculation of the multiplication operation circuit is completed, the demultiplexer returning calculation results Pi, 1'-Pi, n' to the VNi; and each variable node converting the obtained updated confidence probability values Pi, 1'-Pi, n' into a random bit stream through a re-randomization unit, and outputting the random bit stream to the corresponding check node. According to the invention, a multiplication circuit is multiplexed by a plurality of variable nodes, the plurality of variable nodes transmit confidence probability values to be processed to multiplication circuit in turn in time-sharing manner through multiplexer for calculation. According to the method, the performance of the semi-random decoder is not remarkably reduced, and resources consumed by the variable nodes are remarkably reduced at the same time.

Description

technical field [0001] The invention belongs to the field of channel coding and decoding in wireless communication, and more specifically relates to a variable node multiplexing method of a semi-random decoder. Background technique [0002] The Belief Propagation (BP) algorithm is a decoding algorithm widely used in LDPC (Low Density Parity Check Code) codes, Raptor codes, Turbo codes and RCM (Rate Compatible Modulation for blind rate adaptive transmission) . The BP decoding algorithm transmits confidence information between the check node and the variable node, and the decoding process gradually tends to converge through repeated iterative calculations. Since the BP decoding algorithm has natural node parallelism, it is very suitable for implementing a decoder with a high degree of parallelism, thereby improving the decoding throughput. However, due to the high complexity of check nodes and variable nodes, and the large number of nodes, it is difficult to implement a deco...

AI Technical Summary

Problems solved by technology

[0006] Aiming at the defects of the prior art, the object of the present invention is to provide a variable node multiplexing method of a semi-random decoder, aiming to solve the problem of a large number of multiplication operations in the dependent variable nodes in the existing semi-random decoder, which leads to semi-random The problem of high hardware resource overhead of variable nodes in random decoder

Images