IP Library Granted Patent US 6,961,395
Granted Patent B2
US 6,961,395 · App. 10/001,877 · Granted Nov 1, 2005

Time variant filter implementation

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 6,961,395
App. No.
10/001,877
Granted
Nov 1, 2005
Kind
B2
Abstract

The present invention relates to the efficient realization of a time variant multi-rate FIR filter cascaded with a time invariant FIR filter. Preferably, the time invariant FIR filter response provides filtering based on channel estimates and the time variant FIR filter provides filtering to effectively implement spreading and scrambling with appropriate coding. The realization of the combined filters is accomplished by transforming the pair of filters into a single “combined” polyphase filter with coefficients that are time variant in a specific manner. The invention provides for pre-calculating the coefficients of the combined filter; a memory storage and addressing scheme for the resulting coefficients that ensures that the combined filter behaves like the original pair of filters; and overall polyphase decomposition of the resulting filter to significantly reduce the computational complexity as compared to the requirements of the original pair of filters.

Claims (231)

1. A method for filtering a signal comprising:

a) calculating each filter coefficient for a combined time invariant finite impulse response (FIR) filter and a time variant FIR filter;

b) storing each filter coefficient in a memory array in addressable groups corresponding to a filtering period; and

c) filtering data to implement the combined time invariant FIR filter and time variant FIR filter using a polyphase decomposition of the filter coefficients to create an output signal.

2. The method of claim 1 wherein the time invariant FIR filter response provides filtering based on a channel estimate.

3. The method of claim 2 wherein the time variant FIR filter provides filtering based on at least one of the group consisting of spreading and scrambling.

4. The method of claim 1 wherein filter calculations occur at a lower sampling rate and the output signal is provided at a higher sampling rate.

5. The method of claim 1 wherein the data is downsampled prior to filtering such that filter calculations occur at a lower sampling rate.

6. The method of claim 1 wherein the coefficients for the combined time invariant FIR filter and time variant FIR filter are calculated to emulate a time variant FIR filter preceding a time variant FIR filter.

7. The method of claim 6 wherein a k (n) represents coefficients for the time variant FIR filter, b m−k (n) represents the coefficients for the time invariant FIR filter, c m (n) represents the coefficients for the combined time invariant FIR filter and time variant FIR filter and values for c m (n) are calculated as follows:

c

m

(

n

)

=

k

=

max

(

0

,

m

-

N

f

)

min

(

m

,

N

v

)

a

k

(

n

-

m

+

k

)

b

m

-

k

wherein N v represents an order of the time variant FIR filter and N f represents an order of the time invariant FIR filter.

8. The method of claim 7 wherein the memory array includes T VARIATION rows and N v +N f +1 columns and T VARIATION is the product of R and P wherein there are R sets of values for the time variant coefficients, a k (n), and the values of a k (n) change every P sample periods.

9. The method of claim 8 wherein the filtering step further comprises selecting each of the coefficients for the combined time invariant FIR filter and time variant FIR filter, c m (n), from the memory array using a common index.

10. The method of claim 9 wherein the memory index is initialized to a first row in the memory array and incremented one row each sample period.

11. The method of claim 1 wherein the coefficients for the combined time invariant FIR filter and time variant FIR filter are calculated to emulate a time variant FIR filter following a time variant FIR filter.

12. The method of claim 1 wherein a k (n) represents coefficients for the time variant FIR filter, b m−k (n) represents the coefficients for the time invariant FIR filter, c m (n) represents the coefficients for the combined time invariant FIR filter and the time variant FIR filter and values for c m (n) are calculated as follows:

c

m

(

n

)

=

k

=

max

(

0

,

m

-

N

f

)

min

(

m

,

N

v

)

a

k

(

n

)

b

m

-

k

wherein N v represents an order of the time variant FIR filter and N f represents an order of the time invariant FIR filter.

13. The method of claim 12 wherein the memory array includes R rows and N v +N f +1 columns wherein there are R sets of values for the time variant coefficients, a k (n), and the values of a k (n) change every P sample periods.

14. The method of claim 13 wherein the filtering step further comprises selecting each of the coefficients for the combined time invariant FIR filter and time variant FIR filter, c m (n), from the memory array using a common index.

15. The method of claim 14 wherein the memory index is initialized to a first row in the memory array and incremented one row each sample period.

16. The method of claim 1 further comprising:

a) receiving an input signal over a select period, the input signal including a plurality of user signals;

b) for each of the plurality of user signals, subtracting individual regenerated signals corresponding to all other of the plurality of user signals from the input signal to create an individual signal;

c) demodulating each individual signal to provide a corresponding demodulated individual signal;

d) processing each demodulated individual signal to determine symbol estimates for each symbol included therein; and

e) creating the individual regenerated signals from the symbol estimates using the calculating, storing and filter steps.

17. A system comprising:

a) receiving circuitry for receiving and downconverting a transmitted signal to provide a downconverted signal; and

b) a baseband processor adapted to receive the downconverted signal and;

i) calculate each filter coefficient for a combined time invariant finite impulse response (FIR) filter and time variant FIR filter;

ii) store each filter coefficient in a memory array in addressable groups corresponding to a filtering period; and

iii) filter data in the downconverted signal with the combined time invariant FIR filter and time variant FIR filter using a polyphase decomposition of the filter coefficients to create an output signal.

18. The system of claim 17 wherein the time invariant FIR filter response provides filtering based on a channel estimate.

19. The system of claim 17 wherein the time variant FIR filter provides filtering based on at least one of the group consisting of spreading and scrambling.

20. The system of claim 17 wherein filter calculations occur at a lower sampling rate and the output signal is provided at a higher sampling rate.

21. The system of claim 17 wherein the data is downsampled prior to filtering such that filter calculations occur at a lower sampling rate.

22. The system of claim 17 wherein the coefficients for the combined time invariant FIR filter and time variant FIR filter are calculated to emulate a time variant FIR filter preceding a time invariant FIR filter.

23. The system of claim 22 wherein a k (n) represents coefficients for the time variant FIR filter, b m−k (n) represents the coefficients for the time invariant FIR filter, c m (n) represents the coefficients for the combined time invariant FIR filter and time variant FIR filter and values for c m (n) are calculated as follows:

c

m

(

n

)

=

k

=

max

(

0

,

m

-

N

f

)

min

(

m

,

N

v

)

a

k

(

n

-

m

+

k

)

b

m

-

k

,

wherein N v represents an order of the time variant FIR filter and N f represents an order of the time invariant FIR filter.

24. The system of claim 23 wherein the memory array includes T VARIATION rows and N v +N f +1 columns and T VARIATION is the product of R and P wherein there are R sets of values for the time variant coefficients, a k (n), and the values of a k (n) change every P sample periods.

25. The system of claim 24 wherein during filtering the baseband processor is further adapted to select each of the coefficients for the combined time invariant FIR filter and the time variant FIR filter, c m (n), are selected from the memory array using a common index.

26. The system of claim 25 wherein the common index is initialized to a first row in the memory array and incremented one row each sample period.

27. The system of claim 17 wherein the coefficients for the combined time invariant FIR filter and time variant FIR filter are calculated to emulate a time variant FIR filter following a time invariant FIR filter.

28. The system of claim 27 wherein a k (n) represents coefficients for the time variant FIR filter, b m−k (n) represents the coefficients for the time invariant FIR filter, c m (n) represents the coefficients for the combined time invariant FIR filter and time variant FIR filter and values for c m (n) are calculated as follows:

c

m

(

n

)

=

k

=

max

(

0

,

m

-

N

f

)

min

(

m

,

N

v

)

a

k

(

n

)

b

m

-

k

,

wherein N v represents an order of the time variant FIR filter and N f represents an order of the time invariant FIR filter.

29. The system of claim 28 wherein the memory array includes R rows and N v +N f +1 columns wherein there are R sets of values for the time variant coefficients, a k (n), and the values of a k (n) change every P sample periods.

30. The system of claim 29 wherein during filtering the baseband processor is further adapted to select each of the coefficients for the combined time invariant FIR filter and time variant FIR filter, c m (n), are selected from the memory array using a common index.

31. The system of claim 30 wherein the common index is initialized to a first row in the memory array and incremented one row each sample period.

32. The system of claim 31 wherein the downconverted signal is received over a select period and includes a plurality of user signals and the baseband processor is further adapted to:

a) for each user signal, subtract individual regenerated signals corresponding to all other user signals from the input signal to create an individual signal;

b) demodulate each individual signal to provide a corresponding demodulated individual signal;

c) process each demodulated individual signal to determine symbol estimates for each symbol included therein; and

d) create the individual regenerated signals from the symbol estimates using the calculate, store and filter functions.

33. A system for filtering a signal comprising:

a) means for calculating each filter coefficient for a combined time invariant finite impulse response (FIR) filter and time variant FIR filter wherein the time invariant FIR filter response provides filtering based on a channel estimate and the time variant FIR filter provides filtering based on at least one of the group consisting of spreading and scrambling;

b) means for storing each filter coefficient in a memory array in addressable groups corresponding to a filtering period; and

c) means for filtering symbols to implement the combined time invariant FIR filler and time variant FIR filter using a polyphase decomposition of the filter coefficients to create a regenerated signal wherein filter calculations occur at a lower sampling rate and the regenerated signal is provided at a higher sampling rate.

Assignments (10)
PATENT SECURITY AGREEMENT Recorded Apr 22, 2023
From: RPX CORPORATION
To: BARINGS FINANCE LLC, AS COLLATERAL AGENT
Reel/Frame 063429/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 28, 2021
From: PROVENANCE ASSET GROUP LLC
To: RPX CORPORATION
Reel/Frame 059352/0001 →
RELEASE OF SECURITY INTEREST Recorded Nov 30, 2021
From: NOKIA US HOLDINGS INC.
To: PROVENANCE ASSET GROUP HOLDINGS LLC; PROVENANCE ASSET GROUP LLC
Reel/Frame 058363/0723 →
RELEASE OF SECURITY INTEREST Recorded Nov 30, 2021
From: CORTLAND CAPITAL MARKETS SERVICES LLC
To: PROVENANCE ASSET GROUP HOLDINGS LLC; PROVENANCE ASSET GROUP LLC
Reel/Frame 058983/0104 →
ASSIGNMENT AND ASSUMPTION AGREEMENT Recorded Feb 14, 2019
From: NOKIA USA INC.
To: NOKIA US HOLDINGS INC.
Reel/Frame 048370/0682 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 13, 2017
From: NOKIA TECHNOLOGIES OY; NOKIA SOLUTIONS AND NETWORKS BV; ALCATEL LUCENT SAS
To: PROVENANCE ASSET GROUP LLC
Reel/Frame 043877/0001 →
SECURITY INTEREST Recorded Sep 13, 2017
From: PROVENANCE ASSET GROUP HOLDINGS, LLC; PROVENANCE ASSET GROUP LLC
To: NOKIA USA INC.
Reel/Frame 043879/0001 →
SECURITY INTEREST Recorded Sep 13, 2017
From: PROVENANCE ASSET GROUP HOLDINGS, LLC; PROVENANCE ASSET GROUP, LLC
To: CORTLAND CAPITAL MARKET SERVICES, LLC
Reel/Frame 043967/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 3, 2009
From: NORTEL NETWORKS LIMITED
To: ALCATEL LUCENT (FORMERLY KNOWN AS ALCATEL)
Reel/Frame 023456/0476 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 16, 2001
From: FULLER, ARTHUR T. G.; MORRIS, BRADLEY J.
To: NORTEL NETWORKS LIMITED
Reel/Frame 012354/0080 →