MMSE-IICPD (minimum mean-square error-iterative interference cancellation parallel detection) algorithm applicable to efficient calculation of symbol detection on parallel transmission system

Abstract

The embodiment of the invention provides an MMSE-IICPD (minimum mean-square error-iterative interference cancellation parallel detection) algorithm applicable to efficient calculation of symbol detection on a parallel transmission system, and relates to the technical field of communication. Under the condition that the detection performance is unchanged, the complexity of the algorithm is obviously reduced. The algorithm comprises the steps: performing interference cancellation FORMULA on the current detected symbol xi in N symbols x=[x1, ..., xN]<T> which are transmitted in parallel, and performing MMSE wave filtering on yi to obtain a filtering result: FORMULA, wherein f(i, new) is the ith row of an MMSE wave filtering matrix Fnew, and Fnew=DHH(HDHH+ N0IM)<-1>, f(i, new)=FORMULA, D=diag(d), d=[d1, ..., dN]<T> is a residual interference variance of x=[x1, ..., xN]<T>; calculating a measurement value omega new(ak) of the current detected symbol xi at all modulation constellation points ak according to the wave filtering result, and calculating soft judgment and the residual interference variance of xi for next iterative use according to the measurement value of xi at all the constellation points.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to a computationally efficient MMSE-IICPD (Minimum mean-square error-Iterative Interference Cancellation Parallel Detection) suitable for symbol detection in parallel transmission systems )algorithm. Background technique [0002] For parallel transmission systems such as MIMO (Multi-input Multi-output), CDMA (Code Division Multiple Access, Code Division Multiple Access), how to achieve high-performance and low-complexity detection is a key technology and difficulty in wireless communication. Existing algorithms can be divided into two schemes, joint detection and linear detection, both of which can be performed in non-iterative and iterative ways. The joint detection algorithm is the optimal maximum a posteriori probability algorithm. However, the complexity of the algorithm is extremely high, so it has only theoretical significance and no practical application value...

AI Technical Summary

Problems solved by technology

The complexity of the classic MMSE-IICPD algorithm mainly comes from the matrix inversion calculation in MMSE filtering, so when N is large, the complexity of the classi

Images