US 9,001,924 B1Granted

Matrix inversion

AssigneeXilinx, Inc.

InventorsMichael Wu, Bei Yin, Aida Vosoughi, Christopher H. Dick, Christoph E. Studer, Joseph R. Cavallaro

Life of this patent

Estimating the term…

Loading patent…

Abstract

An apparatus relating generally to matrix inversion is disclosed. This apparatus includes a matrix inversion module coupled to receive matrix information and to provide an approximation of an inversion of the matrix information. The matrix inversion module comprises a decomposition block coupled to receive the matrix information and to decompose the matrix information into diagonal matrix information and off diagonal matrix information, and an expansion block. The expansion block is coupled to receive the diagonal matrix information and the off diagonal matrix information, and to invert a matrix sum of the diagonal matrix information and the off diagonal matrix information by generation of a portion of a series expansion.

Claims16

Dependent claims

An apparatus in a MIMO (Multiple Input Multiple Output) communication system, comprising:

a memory;
one or more processor,
wherein the one or more processor coupled to the memory and wherein the one or more processor includes:
a matrix inversion module coupled to receive matrix information and to provide an approximation of an inversion of the matrix information;
wherein the matrix inversion module comprises:
a decomposition block coupled to receive the matrix information and to decompose the matrix information into diagonal matrix information and off diagonal matrix information;
and
an expansion block coupled to receive the diagonal matrix information and the off diagonal matrix information and to invert a matrix sum of the diagonal matrix information and the off diagonal matrix information by generation of a portion of a series expansion;
wherein the portion of the series expansion is a portion of a Neumann series expansion for a finite number of k terms, for k equal to or greater than 2;
and
wherein the approximation of the inversion of the matrix information is provided by the portion of the Neumann series expansion for the k terms,
wherein, the portion of the Neumann series expansion is for the k terms and is mathematically expressed as:
{tilde over (Ax−1)}=Σn=0k-1(−D−1E)nD−1,
where A represents the matrix information, D represents the diagonal matrix information, and E represents the off diagonal matrix information.

11 more elements

A method, comprising:

receiving input matrix information by a decomposition block;
decomposing with the decomposition block the input matrix information into diagonal matrix information and off diagonal matrix information;
receiving the diagonal matrix information and the off diagonal matrix information by an expansion block processor;
generating with the expansion block processor a portion of a series expansion to provide an inversion of a matrix sum of the diagonal matrix information and the off diagonal matrix information;
wherein the portion of the series expansion is an approximation of an inversion of the input matrix information;
outputting the inversion of the matrix sum;
wherein the portion of the series expansion is a portion of a Neumann series expansion for a finite number of k terms, for k equal to or greater than 2;
and
wherein the approximation of the inversion of the input matrix information is provided by the portion of the Neumann series expansion for the k terms;
wherein, the portion of the Neumann series expansion is for the k terms and is mathematically expressed as:
{tilde over (Ax−1)}=Σn=0k-1(−D−1E)nD−1,
where A represents the matrix information, D represents the diagonal matrix information, and E represents the off diagonal matrix information.

9 more elements

Dependencies are inferred from the claim text.