Probability calculation-based TPC iterative decoding method and decoder

Abstract

The invention discloses a TPC iterative decoding method and decoder based on probability calculation, and relates to the field of wireless communication, and the technical scheme is characterized in that a log-likelihood ratio matrix is fused with external information, and a random bit stream and a random number generated randomly are compared and judged; performing BCH codeword self-check, extended bit parity check and Euclidean distance check on the initial hard decision row decoding result and the initial hard decision column decoding result to obtain initial row check information and initial column check information; performing fusion check updating on the initial row check information and the initial column check information according to the zone bit distribution condition to obtain row fusion check information and column fusion check information; and performing iterative processing. By means of probability calculation and extrinsic information updating strategies, complex test pattern generation can be achieved through a simple random calculation method, complete TPC iterative decoding is achieved, the structure is simple, implementation is easy, hardware implementation complexity is greatly reduced, and hardware efficiency is improved.

Description

technical field [0001] The invention relates to the field of wireless communication, more specifically, it relates to a TPC iterative decoding method and a decoder based on probability calculation. Background technique [0002] TPC (Turbo Product Code, Turbo product code) is a kind of forward error correction code. The biggest difference between this code and the traditional one-dimensional forward error correction code is that it uses a two-dimensional code, which is currently commonly used in TPC subcodes. The types of words include BCH code, Hamming code, RS code and some of their extension codes. The code has the characteristics of very simple structure, high coding efficiency (frequency band utilization), low algorithm complexity, suitable for parallel processing, and high-speed coding and decoding on a very large-scale programmable logic array (FPGA) by using a pipeline mechanism. It is a good solution for high-speed data transmission systems. And it is generally bel...

AI Technical Summary

Problems solved by technology

Although the complexity of the Chase-II algorithm has been greatly reduced compared with the ML algorithm and has performance advantages, the hardware complexity of the Chase-II algorithm is still very high, which is not conducive to the implementation of integrated circuit hardware.

[0004] The Pyndia-Chase-II decoding algorithm is a kind of soft-input soft-output (SISO) iterative decoding algorithm of TPC code. Increase the calculation of external information and form the update and exchange of external information between ranks and columns. The soft decision decoder of this algorithm is realized on the basis of Chase-II decoding algorithm, which is similar to Chase-II algorithm, Pyndiah-Chase- In the hardware implementation of II decoding algorithm, complex logic and storage overhead are the bottleneck of complexity and power consumption overhead

Images