← Back to Patent Explorer
US6330292B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Reduced power matched filter

Assignee: Telefonaktiebolaget LM Ericsson AB
•
Filing: 1998-11-23
•
Granted: 2001-12-11
•
Expires: 2018-11-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A matched filter for use in a radio telephone receiver that receives Code Division Multiple Access (CDMA) signals. The matched filter produces precombinations of input values to significantly reduce the number of multiplication and addition operations, compared to conventional matched filters, required to produce a correlation value. This reduced number of required operations, along with a reduced number of delay elements required to despread CDMA signals, significantly reduces the overall power consumption of the matched filter. The use of such a matched filter in a device like a cellular phone, for example, would thus lead to longer battery life.

Inventors

  • 👤 Paul Dent
  • 👤 Kenzo Urabe

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 12:54
CPC Classifications
H; H04; H04B; H04B1/00; H04B1/06; H04B1/16; H04B1/69; H04B1/707; H04B1/7073; H04B1/7075; H04B1/70751; H04B1/70752; G; G06; G06F; G06F17/00; G06F17/10; G06F17/15; H04B1/709; H04B1/7093; H04B1/7095; H04B2201/00; H04B2201/69; H04B2201/707; H04B2201/70707

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 95 words
A matched filter for forming correlations between a stream of signal samples presented at a rate determined by a sample rate clock and a given binary code having a plurality of binary bits, comprising: precombining means for forming precombinations of groups of input samples; a plurality of selection means each controlled by a group of the binary bits to select one of the precombinations in dependence thereon; addition means for combining the selected precombinations with a delayed sum to obtain an undelayed sum; and delay means for delaying undelayed sums to produce the delayed sums.
Claim 2
Dependent Claim 95 words
A matched filter for forming correlations between a stream of signal samples presented at a rate determined by a sample rate clock and a given binary code having a plurality of binary bits, comprising: precombining means for forming precombinations of groups of input samples; a plurality of selection means each controlled by a group of the binary bits to select one of the precombinations in dependence thereon; addition means for combining the selected precombinations with a delayed sum to obtain an undelayed sum; and delay means for delaying undelayed sums to produce the delayed sums.
Claim 3
Dependent Claim 48 words
The matched filter of claim 1 , wherein the delay means is divided into a number of banks of delay elements, each bank being clocked with a respective phase of a multiphase clock derived by dividing the frequency of the sample rate clock by the number of banks.
Claim 4
Dependent Claim 25 words
The matched filter of claim 2 , wherein the number of banks is equal to the number of samples in the groups of input samples.
Claim 5
Dependent Claim 32 words
The matched filter of claim 1 , wherein the number of said precombinations formed is equal to two to the power of the number of samples in the groups of input samples.
Claim 6
Dependent Claim 35 words
The matched filter of claim 1 , wherein the number of said precombinations formed is equal to two to the power of the number of samples in the groups of input samples divided by two.
Claim 7
Independent Claim 91 words
A method for forming correlations between a stream of signal samples presented at a rate determined by a sample rate clock and a given binary code having a plurality of binary bits, comprising the steps of: precombining groups of input samples to form precombinations of the groups of input samples; selecting a plurality of the precombinations, the selecting controlled by a group of the binary bits; adding the selected precombinations with delayed partial sums to obtain undelayed partial sums; and delaying the undelayed partial sums to produce the delayed partial sums.
Claim 8
Independent Claim 91 words
A method for forming correlations between a stream of signal samples presented at a rate determined by a sample rate clock and a given binary code having a plurality of binary bits, comprising the steps of: precombining groups of input samples to form precombinations of the groups of input samples; selecting a plurality of the precombinations, the selecting controlled by a group of the binary bits; adding the selected precombinations with delayed partial sums to obtain undelayed partial sums; and delaying the undelayed partial sums to produce the delayed partial sums.
Claim 9
Dependent Claim 47 words
The method of claim 6 , wherein the delaying step is performed by a number of banks of delay elements, each bank being clocked with a respective phase of a multiphase clock derived by dividing the frequency of the sample rate clock by the number of banks.
Claim 10
Dependent Claim 27 words
The method of claim 7 , wherein the number of banks of delay elements is equal to the number of samples in the groups of input samples.
Claim 11
Dependent Claim 31 words
The method of claim 6 , wherein the number of said precombinations formed is equal to two to the power of the number of samples in the groups of input samples.
Claim 12
Dependent Claim 34 words
The method of claim 6 , wherein the number of said precombinations formed is equal to two to the power of the number of samples in the groups of input samples divided by two.
Claim 13
Independent Claim 78 words
A method of producing correlations between successive shifts of a numerical sample sequence and at least one given binary code containing a plurality of binary bits, comprising the steps of: forming a number of precombinations of successive ones of the numerical samples, the number of precombinations formed being less than a number of samples in the numerical sample sequence; applying different patterns of sign inversions to selected precombinations; and delaying and adding selected precombinations to produce the correlations.
Claim 14
Independent Claim 78 words
A method of producing correlations between successive shifts of a numerical sample sequence and at least one given binary code containing a plurality of binary bits, comprising the steps of: forming a number of precombinations of successive ones of the numerical samples, the number of precombinations formed being less than a number of samples in the numerical sample sequence; applying different patterns of sign inversions to selected precombinations; and delaying and adding selected precombinations to produce the correlations.
Claim 15
Dependent Claim 21 words
The method of claim 11 , wherein the precombinations are formed in a Grey-coded order of the corresponding different sign patterns.
Claim 16
Dependent Claim 32 words
The method of claim 11 , wherein at least one of the sign inversions in the patterns of sign inversions are based on at least one of the plurality of binary bits.
Claim 17
Dependent Claim 53 words
The method of claim 11 , wherein the step of delaying and adding comprises: delaying the selected precombinations in a number of banks of delay elements, each bank being clocked with a respective phase of a multiphase clock derived by dividing the frequency of the sample rate clock by the number of banks.
Claim 18
Independent Claim 89 words
An apparatus for producing correlations between successive shifts of a numerical sample sequence and at least one given binary code containing a plurality of binary bits, comprising: a first circuit for forming a number of precombinations of successive ones of the numerical samples, the number of precombinations formed being less than a number of samples in the numerical sample sequence; a second circuit for applying different patterns of sign inversions to selected precombinations; and delaying means and adding means for delaying and adding selected precombinations to produce the correlations.
Claim 19
Independent Claim 89 words
An apparatus for producing correlations between successive shifts of a numerical sample sequence and at least one given binary code containing a plurality of binary bits, comprising: a first circuit for forming a number of precombinations of successive ones of the numerical samples, the number of precombinations formed being less than a number of samples in the numerical sample sequence; a second circuit for applying different patterns of sign inversions to selected precombinations; and delaying means and adding means for delaying and adding selected precombinations to produce the correlations.
Claim 20
Dependent Claim 23 words
The apparatus of claim 15 , wherein the precombinations are formed in a Grey-coded order of the corresponding different patterns of sign inversions.
Claim 21
Dependent Claim 32 words
The apparatus of claim 15 , wherein at least one of the sign inversions in the patterns of sign inversions are based on at least one of the plurality of binary bits.
Claim 22
Dependent Claim 53 words
The apparatus of claim 15 , wherein the delaying means comprises: at least one bank of delay elements for delaying the selected precombinations, each bank being clocked with a respective phase of a multiphase clock derived by dividing the frequency of the sample rate clock by the number of banks of delay elements.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2004-12-10 2005-06-11 2005-12-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2008-12-10 2009-06-11 2009-12-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2012-12-10 2013-06-11 2013-12-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag