The present invention relates to a receiver having an adaptive filter and to a method of adapting and optimising the characteristics of the adaptive filter. The receiver has particular, but not exclusive, application to receiving broadband OFDM/CDMA signals in the ISM band.
The present invention relates to a receiver having an adaptive filter and to a method of adapting and optimising the characteristics of the adaptive filter. The receiver has particular, but not exclusive, application to receiving broadband OFDM/CDMA signals in the ISM band.
Many receivers use some form of digital filtering for a variety of purposes including channel selection, channel rejection and interference rejection. The specific filtering requirements for individual scenarios are generally dynamic, for example for channel or interference rejection, and in these situations a dynamic filter allows optimum performance, for example how well an interferer is rejected, for the least complexity and/or power consumption.
In a broadband OFDM/CDMA system operating in the ISM band there are many sources of interference, one of which is narrowband frequency hopping systems. Adaptive filters can be used in CDMA applications where CDMA signals are interfered with by a narrowband jammer. In an article “Adaptive Digital Signal Processing JAVA Teaching Tool” by M. Hartneck and R. W. Stewart, submitted to IEEE Transactions on Education-Special CDROM Issue, November 1999, also available on the internet at: http://www.spd.eee.strath.ac.uk/users/bob/adaptivejava/begin.htm, there is disclosed an example of CDMA interference suppression in which if a broadband (stochastic) signal has interference from a narrowband (periodic) source a prediction architecture can be used to attempt to find correlation between an output y(k) of an adaptive filter and an input signal which has been fed forward from a delayed input of the adaptive filter. By taking the difference between the signals, viz. d(k)−y(k), the narrowband signal is attenuated and it is found that an output signal e(k) is approximately equal to the signal applied by a data source to the transmission channel. As a generality adaptive filters use error calculations in order to make minor adjustments to the filter coefficients. As the demands for high performance filtering grow there is an attendant problem of complexity and increased power consumption.
An object of the present invention is to provide an adaptive filter which can achieve a high performance coupled with a less complex structure and a lower power consumption than known adaptive filters.
According to one aspect of the present invention there is provided a method of dynamically adapting a digital filter characteristic, comprising storing a predetermined frequency representation of the filter, analysing an input signal, adapting the filter characteristic to match the system requirements, transforming a frequency domain representation of the adapted filter characteristic to the time domain, and calculating new filter coefficients to effect the adaption of the filter characteristics.
According to a second aspect of the present invention there is provided a receiver comprising an adaptive filter having an input for a digitised input signal, means for storing a pre-designed filter characteristic, means for analysing a digital representation of the input signal to determine a desired position of the filter characteristic to match the system requirements, means for adapting the stored pre-designed filter characteristic to match the system requirements, and means for transforming the adapted filter characteristic to the time domain to update coefficients for the adaptive filter and for loading updated coefficients into adaptive filter.
The adaptation of the filter characteristic may be effected in the frequency domain, for example by moving filter taps to the left or right and then doing an IFFT, in the time domain, for example by multiplying all time domain taps by a sine wave of the desired shift frequency, or in a combination of both frequency and time domains.
The present invention will now be described, by way of example, with reference to the accompanying drawings, wherein:
In the drawings the same reference numerals have been used to indicate corresponding features.
Referring to
A frequency domain version of the original FIR filter is stored in a memory 30 which is coupled to the second stage 28. The second stage 28 is coupled by a line 32 to the FIR filter 22 to enable new coefficients to be loaded with the FIR filter 22. The calculation and loading of new coefficients may be periodic, for example once every N communication frames to reduce the burden on the DSP 24.
In operation of the receiver, a pre-designed frequency representation of the filter is stored in the memory 30 and the characteristics are adapted as a result of analysing the input signal in the first stage 26 to match those required by the system. The adaptation of the filter characteristic can be effected (a) in the frequency domain by shifting frequency domain filter taps left or right in the frequency domain and then doing an IFFT, (b) in the time domain by multiplying time domain filter taps by a sine wave of the required frequency, or (c) a combination of both by initially adapting the characteristic in the frequency domain and manipulating the characteristic further in the time domain.
Although the frequency domain and the time domain methods are equivalent, the frequency domain method has an inherent granularity, that is the frequency of the filter can be shifted by, for example (100, 200, 300, . . . 1300, 1400 . . . N*100) Hz, whereas the time domain method enables a precise frequency shift of say 1 MHz to be effected.
Once adapted, the frequency domain representation of the filter is transformed back to the time domain in order to obtain the new coefficients or tap weightings which are loaded into the FIR filter 22 by way of the line 32.
Before describing the flow chart in
In operation the DSP 24 determines the position of the interferer and manipulates the filter 22 so that the notch 34 is shifted to block the interferer.
In many cases the receiver can predict where the interferer will frequency hop to because the hopping algorithms are known and can therefore act pro-actively rather than reactively and insodoing make further performance gains.
Referring to
In block 50 a check is made to see if bandwidth has to be altered, and if so (Y) then block 52 denotes adjusting the bandwidth.
In block 54 a check is made to see if a frequency shift is required and if so (Y) then in block 56 the frequency is shifted.
In block 58 a check is made to see if characteristics are to be superimposed and if so (Y) then this is carried out in block 60.
A negative output (N) from each of the blocks 50, 54 and 58 is supplied together with outputs from the blocks 52, 56, 60 to a block 62 which denotes transforming the adjusted frequency domain representation back to the time domain using a FFT which is equal in size to the number of sample points. Block 64 relates to the receiver updating the FIR filters coefficients with the result from the block 62. The new coefficients may be calculated continuously or periodically, for example once every N communication frames.
The flow chart thereafter returns to the block 46 whenever an update is required.
Referring now to
The teachings of the present invention can be applied to a bandpass filter having application to purposes such as channel selection in say a base station.
Referring to
Lastly,
In the present specification and claims the word “a” and “an” preceding an element does not exclude the presence of a plurality of such elements. Further, the word “comprising” does not exclude the presence of other elements or steps than those listed.
From reading the present disclosure, other modifications will be apparent to persons skilled in the art. Such modifications may involve other features which are already known in the design, manufacture and use of receivers having adaptive filters and component parts therefor and which may be used instead of or in addition to features already described herein.
Number | Date | Country | Kind |
---|---|---|---|
0116493.8 | Jul 2001 | GB | national |
Number | Name | Date | Kind |
---|---|---|---|
5268927 | Dimos et al. | Dec 1993 | A |
5329587 | Morgan et al. | Jul 1994 | A |
5355418 | Kelsey et al. | Oct 1994 | A |
5396299 | Greenberg | Mar 1995 | A |
5654765 | Kim | Aug 1997 | A |
5671168 | Liu et al. | Sep 1997 | A |
5825898 | Marash | Oct 1998 | A |
6142942 | Clark | Nov 2000 | A |
6201843 | Kingston et al. | Mar 2001 | B1 |
6222592 | Patel | Apr 2001 | B1 |
6269093 | Alapuranen et al. | Jul 2001 | B1 |
6324559 | Hellberg | Nov 2001 | B1 |
6483923 | Marash | Nov 2002 | B1 |
6504579 | Scherrer | Jan 2003 | B1 |
6535552 | Pessoa | Mar 2003 | B1 |
6577670 | Roberts | Jun 2003 | B1 |
6704438 | Alexandru | Mar 2004 | B1 |
6714587 | Van Houtum et al. | Mar 2004 | B1 |
6804313 | Skafidas et al. | Oct 2004 | B2 |
6959056 | Yeap et al. | Oct 2005 | B2 |
6990061 | Deneire et al. | Jan 2006 | B2 |
20020021715 | Matheus et al. | Feb 2002 | A1 |
20020097341 | Patel et al. | Jul 2002 | A1 |
20020168001 | Ramsey | Nov 2002 | A1 |
20030007554 | Birru | Jan 2003 | A1 |
20040120249 | Blasco Claret et al. | Jun 2004 | A1 |
Number | Date | Country |
---|---|---|
0 982 861 | Mar 2000 | EP |
6-326559 | Nov 1994 | JP |
2000-312167 | Nov 2000 | JP |
2001-7746 | Jan 2001 | JP |
2001-144636 | May 2001 | JP |
WO 03005581 | Jan 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20030007553 A1 | Jan 2003 | US |