A Variable Node Multiplexing Method for Semi-Random Decoder

Abstract

The invention discloses a variable node multiplexing method of a semi-random decoder, which belongs to the field of channel coding and decoding in wireless communication. A variable node is selected from the nodes, denoted as VN i , its confidence probability value P i,1 ~P i,n Calculate with the multiplication circuit; after completing the calculation of the multiplication circuit, the demultiplexer will calculate the result P i,1 '~P i,n 'Return VN i ; Each variable node will obtain the updated confidence probability value P i,1 '~P i,n 'Transform it into a random bit stream through the re-randomization unit, and output it to the corresponding check node. The present invention uses a plurality of variable nodes to multiplex a multiplication operation circuit, and multiple variable nodes take turns to transmit the confidence probability value to be processed to the multiplication operation circuit through a multiplexer for calculation in a time-sharing manner. The present invention does not significantly reduce the Semi-random decoder performance while significantly reducing the resources consumed by variable nodes.

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