IP Library Granted Patent US 7,672,409
Granted Patent B2
US 7,672,409 · App. 11/181,700 · Granted Mar 2, 2010

Base station software for multi-user detection uplinks and downlinks and method thereof

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 7,672,409
App. No.
11/181,700
Granted
Mar 2, 2010
Kind
B2
Abstract

A method of multi-user detection in a given uplink and downlink time slot in a software-defined receiver which includes filtering and sampling a received signal; forming a block-banded matrix A of the sampled signals; and solving {circumflex over (d)}=T −1 y, where T=(A H A), y=A H x. The methods of solving for the matrix T includes a) computing Cholesky factors of the matrix T by approximating using the block-banded property of the matrix T and A; b) Schur decomposition for Cholesky factors of the matrix T and approximating the lower triangular Cholesky factor matrix R using block Toeplitz property of matrix T; or c) Fourier Transformation.

Claims (13)

1. A method of multi-user detection in a given uplink and downlink time slot in a software-defined wireless receiver, the method comprising:

receiving a received signal by at least one antenna in the wireless receiver;

filtering and sampling the received signal to create sampled signals;

forming a block-banded matrix A of the sampled signals;

via a multi-threaded processor, solving {circumflex over (d)}=T −1 y, where T=(A H A), y=A H x by selecting between and applying at least one computational approach comprising

(1) applying the inverse matrix T of the system matrix T −1 using a zero-forcing equalizer or decorrelating detector and computing Cholesky factors of the matrix T by approximating using the block-banded property of the matrix T and A, wherein at least the solving and the computing are performed via the multi-threaded processor;

(2) applying Schur decomposition for Cholesky factors of the matrix T, computing a generator matrix G of the matrix T, Givens rotating the matrix G to produce lower triangular Cholesky factor matrix R, and approximating matrix R using block Toeplitz property of matrix T, wherein at least the solving and the computing are performed via the multi-threaded processor;

(3) applying Fourier Transformation and padding the matrix T to make it circulant before solving, wherein at least the solving and the padding are performed via the multi-threaded processor;

wherein the multi-threaded processor is connected to the at least one antenna in the wireless receiver and comprises

a single instruction multiple data (SIMD) Vector/digital signal processor (DSP) unit,

a parallel reduction unit, and

a reduced instruction set computer (RISC)-based integer unit.

2. The method of claim 1 , wherein, when applying the Schur decomposition approach, only first couple of block columns of the matrix R are computed and the last block is copied.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 29, 2012
From: ASPEN ACQUISITION CORPORATION
To: QUALCOMM INCORPORATED
Reel/Frame 029377/0700 →
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNMENT BY SUPPLEMENTING TWO PAGES MISSING FROM THE ASSIGNMENT PREVIOUSLY RECORDED ON REEL 025084 FRAME 0963. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT OF ASSIGNOR'S INTEREST. Recorded Oct 25, 2010
From: SANDBRIDGE TECHNOLOGIES, INC.
To: ASPEN ACQUISITION CORPORATION
Reel/Frame 025178/0760 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 5, 2010
From: SANDBRIDGE TECHNOLOGIES, INC.
To: ASPEN ACQUISITION CORPORATION
Reel/Frame 025084/0963 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 15, 2005
From: SHAMSUNDER, SANYOGITA
To: SANDBRIDGE TECHNOLOGIES, INC.
Reel/Frame 016782/0048 →