The invention discloses a low-complexity quick parallel matrix inversion method. The method comprises the following steps that first, a matrix A is given, a matrix E is made to be a unit matrix with the same order as the matrix A, the matrix A and the matrix E form an expanding matrix B, modified
Givens rotation (MSGR, Modified Square Givens Rotations) is carried out on the matrix B, an upper
triangular matrix U and , wherein according to the define of the matrix U and , an SGR (Squared Givens Rotations) method is used for deforming the QR division of the matrix A according to the equation, and the relation between the QR division and original QR division meets the equations , , , and ; according to the MSRG method, the square root operation in the process of
Givens rotation can be omitted while division operation is reduced, and
algorithm complexity is obviously reduced; second, a back
substitution method is used for working out the inverse matrix U-1 of the upper
triangular matrix U; third, matrix inversion is carried out according to the equation . According to the low-complexity quick parallel matrix inversion method, a large amount of division operation and a large amount of square root operation are omitted,
algorithm complexity is reduced, and the method can be used for matrix inversion of the fields of
wireless communication,
signal processing and numerical calculation.