IP Library Granted Patent US 8,111,742
Granted Patent B2
US 8,111,742 · App. 11/887,826 · Granted Feb 7, 2012

Data processing method, equalizer, receiver, communication system, network element, and terminal using simplified channel matrix inversion

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,111,742
App. No.
11/887,826
Granted
Feb 7, 2012
Kind
B2
Abstract

The invention is related to a communication terminal, comprising: means ( 618 ) for creating at least one channel matrix assuming predetermined interfering signals as a part of a desired signal; means ( 618 ) for dividing the at least one channel matrix into multiple sub-matrices; means ( 618 ) for diagonalizing the sub-matrices by using a transformation matrix; means ( 618 ) for forming at least one block-diagonalized matrix using diagonalized sub-matrices; means ( 618 ) for inverting the at least one block-diagonalized matrix; and means ( 618 ) for generating channel equalizer coefficients by using at least one inverted block-diagonalized matrix.

Claims (65)

1. A method, comprising:

creating, in an apparatus for solving channel equalizer coefficients, at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal;

dividing the at least one channel impulse response matrix into multiple sub-matrices;

diagonalizing the sub-matrices by using a transformation matrix;

forming at least one block-diagonalized matrix using the diagonalized sub-matrices;

inverting the at least one block-diagonalized matrix; and

generating channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

2. The method of claim 1 , further comprising approximating each sub-matrix to be diagonalized as a circulant matrix.

3. The method of claim 1 , wherein a linear transformation matrix is a linear matrix used in a discrete Fourier Transform.

4. The method of claim 1 , further comprising approximating each sub-matrix to be diagonalized as a circulant matrix and forming each circulant matrix of one single row vector of an original matrix by circularly rotating the row vector to form other rows of the circulant matrix.

5. The method of claim 1 , further comprising approximating noise or interference other than the predetermined interfering signals assumed as a part of a desired signal as a white noise.

6. A method, comprising:

creating, in an apparatus for solving channel equalizer coefficients, at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal;

creating at least one block matrix by using the at least one channel impulse response matrix and determining sub-matrices of the at least one block matrix;

diagonalizing the sub-matrices for generating at least one block-diagonalized matrix;

inverting the at least one block-diagonalized matrix; and

generating channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

7. The method of claim 6 , further comprising approximating each sub-matrix to be diagonalized as a circulant matrix.

8. The method of claim 6 , further comprising approximating each sub-matrix to be diagonalized as a circulant matrix and forming each circulant matrix of one single row vector of an original matrix by circularly rotating the row vector to form other rows of the circulant matrix.

9. A computer program, embodied on a non-transitory computer readable medium, wherein the computer program when executed by a processor is configured to control the processor to perform operations comprising:

creating at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal;

dividing the at least one channel impulse response matrix into multiple sub-matrices;

diagonalizing the sub-matrices by using a transformation matrix;

forming at least one block-diagonalized matrix using the diagonalized sub-matrices;

inverting the at least one block-diagonalized matrix; and

generating channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

10. A computer program, embodied on a non-transitory computer readable medium, wherein the computer program when executed by a processor is configured to control the processor to perform operations comprising:

creating at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal;

creating at least one block matrix by using the at least one channel impulse response matrix and determining sub-matrices of the at least one block matrix;

diagonalizing the sub-matrices for generating at least one block-diagonalized matrix;

inverting the at least one block-diagonalized matrix; and

generating channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

11. An apparatus comprising:

means for creating at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal;

means for dividing the at least one channel impulse response matrix into multiple sub-matrices;

means for diagonalizing the sub-matrices by using a transformation matrix;

means for forming at least one block-diagonalized matrix using the diagonalized sub-matrices;

means for inverting the at least one block-diagonalized matrix; and

means for generating channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

12. An apparatus comprising:

at least one processor; and

at least one memory including computer program code,

the at least one memory and the computer program code configured, with the at least one processor, to cause the apparatus at least to

create at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal;

divide the at least one channel impulse response matrix into multiple sub-matrices;

diagonalize the sub-matrices by using a transformation matrix;

form at least one block-diagonalized matrix using the diagonalized sub-matrices;

invert the at least one block-diagonalized matrix; and

generate channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

13. The apparatus of claim 12 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to approximate each sub-matrix as a circulant matrix for the diagonalization.

14. The apparatus of claim 12 , wherein a linear transformation matrix is a linear matrix used in a discrete Fourier Transform.

15. The apparatus of claim 12 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to approximate each sub-matrix as a circulant matrix for the diagonalization and to form each circulant matrix of one single row vector of an original matrix by circularly rotating the row vector.

16. The apparatus of claim 12 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to approximate noise or interference other than the predetermined interfering signals assumed as a part of a desired signal as a white noise.

17. An apparatus, comprising:

at least one processor; and

at least one memory including computer program code,

the at least one memory and the computer program code configured, with the at least one processor, to cause the apparatus at least to

create at least one channel impulse response matrix for a plurality of transmission antennas assuming predetermined interfering signals as a part of a desired signal, and to create at least one block matrix by using the at least one channel impulse response matrix and determining sub-matrices of the at least one block matrix;

diagonalize the sub-matrices for generating at least one block-diagonalized matrix;

invert the at least one block-diagonalized matrix; and

generate channel equalizer coefficients by using the at least one inverted block-diagonalized matrix.

18. The apparatus of claim 17 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to approximate each sub-matrix as a circulant matrix for the diagonalization.

19. The apparatus of claim 17 , wherein a linear transformation matrix is a linear matrix used in a discrete Fourier Transform.

20. The apparatus of claim 17 , wherein the at least one memory and the computer program code are further configured, with the at least one processor, to cause the apparatus to approximate each sub-matrix as a circulant matrix for the diagonalization and to form each circulant matrix of one single row vector of an original matrix by circularly rotating the row vector.

21. The apparatus of claim 12 , the apparatus being an equalizer.

Assignments (4)
SECURITY INTEREST Recorded Jun 1, 2021
From: WSOU INVESTMENTS, LLC
To: OT WSOU TERRIER HOLDINGS, LLC
Reel/Frame 056990/0081 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 18, 2018
From: NOKIA TECHNOLOGIES OY
To: WSOU INVESTMENTS, LLC
Reel/Frame 045084/0282 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 5, 2015
From: NOKIA CORPORATION
To: NOKIA TECHNOLOGIES OY
Reel/Frame 035581/0654 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2007
From: HEIKKILA, MARKKU J.
To: NOKIA CORPORATION
Reel/Frame 019979/0411 →