US5247470A — Method and apparatus for estimating signal compon…

Claim 1

Independent Claim 50 words

An adaptive matched filter comprising means for synchronously sampling an input signal bearing bauded information and undefined noise, and a filter means for estimating on a symbol-by-symbol basis the signal-only output of a predetermined signal replica filter from a symbol-justified input data vector comprised of the synchronously sampled input signal.

Claim 2

Dependent Claim 50 words

An adaptive matched filter comprising means for synchronously sampling an input signal bearing bauded information and undefined noise, and a filter means for estimating on a symbol-by-symbol basis the signal-only output of a predetermined signal replica filter from a symbol-justified input data vector comprised of the synchronously sampled input signal.

Claim 3

Dependent Claim 71 words

The adaptive matched filter according to claim 1 wherein said filter means further comprises: means for weighting the input data vector signal with a weight vector when a symbol of interest is justified within the filter means; and means for iteratively adapting on a symbol-by-symbol basis the weight vector such that the weighted input data vector is a least means squared estimate of the signal-only output of a signal replica filter.

Claim 4

Dependent Claim 29 words

The adaptive matched filter according to claim 2 wherein said means for iteratively adapting the weight vector adapts the weight vector in substantial accordance with a "Griffiths" iteration process.

Claim 5

Independent Claim 80 words

A method of filtering with an adaptive matched filter a bauded signal having one symbol per baud and an arbitrary noise component so as to estimate the signal only output of a signal replica filter, the method comprising the steps of: synchronously sampling an input signal at an integral multiple of the baud rate; weighting the input signal by weights; and adapting the weights so that the output is a least-mean squared estimation of the signal-only output signal replica filter.

Claim 6

Independent Claim 80 words

A method of filtering with an adaptive matched filter a bauded signal having one symbol per baud and an arbitrary noise component so as to estimate the signal only output of a signal replica filter, the method comprising the steps of: synchronously sampling an input signal at an integral multiple of the baud rate; weighting the input signal by weights; and adapting the weights so that the output is a least-mean squared estimation of the signal-only output signal replica filter.

Claim 7

Dependent Claim 36 words

The method of filtering according to claim 4 wherein said step of adapting the weight vector comprises iterating the weight vector so as to minimize the sum of the mean squared estimation errors for each symbol.

Claim 8

Dependent Claim 24 words

The method of filtering according to claim 5 wherein said step of adapting the weights further includes iterating the weights at the baud rate.

Claim 9

Dependent Claim 42 words

The method of filtering according to claim 6 wherein the step of adapting the weight vector takes place while the symbol is centered within the filter such that the samples of the input signal are cyclostationary during the adaptation of the weights.

Claim 10

Dependent Claim 36 words

The method of filtering according to claim 4 wherein the step of adapting the weighting vector comprises minimizing the sum of the mean squared estimation error over a block of symbols by adapting a weight array.

Claim 11

Dependent Claim 69 words

A frequency-domain adaptive matched filter comprising: means to weight an input signal having a bauded signal and noise components on a block-by-block basis, a block comprising a vector of symbols; and means to adapt the weighting of the input signal by iterating on a block-by-block basis so as to minimize the block mean squared error (BMSE) where the desired signal is the signal-only output of a signal replica filter.

Claim 12

Dependent Claim 69 words

A frequency-domain adaptive matched filter comprising: means to weight an input signal having a bauded signal and noise components on a block-by-block basis, a block comprising a vector of symbols; and means to adapt the weighting of the input signal by iterating on a block-by-block basis so as to minimize the block mean squared error (BMSE) where the desired signal is the signal-only output of a signal replica filter.

Claim 13

Dependent Claim 51 words

The frequency-domain adaptive matched filter according to claim 9 wherein said means to weight an input signal further comprises a baud synchronous transversal filter divided into a number of subfilters equal to the number of samples per symbol, each subfilter having a length equal to the number of symbols per block.

Claim 14

Dependent Claim 20 words

The frequency-domain adaptive matched filter according to claim 9 wherein the BMSE estimate is minimized using the "Griffiths" stochastic gradient.

Claim 15

Dependent Claim 62 words

An adaptive matched filter for use in a maximum likelihood (ML) demodulator for improved performance in undefined noise environments, comprising: means for baud-synchronously sampling a signal bearing bauded information; filter means for estimating, when a symbol-of-interest is justified within the filter, a signal-only component of an output of a signal replica filter from a symbol-justified filter input comprised of the sampled signal.

Claim 16

Dependent Claim 62 words

An adaptive matched filter for use in a maximum likelihood (ML) demodulator for improved performance in undefined noise environments, comprising: means for baud-synchronously sampling a signal bearing bauded information; filter means for estimating, when a symbol-of-interest is justified within the filter, a signal-only component of an output of a signal replica filter from a symbol-justified filter input comprised of the sampled signal.

Claim 17

Dependent Claim 32 words

The adaptive matched filter according to claim 12 wherein the filter means comprises: means for weighting the filter input; and means for iteratively adapting the means for weighting on a symbol-by-symbol basis.

Claim 18

Dependent Claim 46 words

The adaptive matched filter according to claim 13 wherein the means for iteratively adapting minimizes the least means squared difference between the weighted filter input and a signal-only component of an output of a predetermined signal replica filter in substantial accordance with a "Griffiths" iteration process.

Claim 19

Dependent Claim 32 words

The adaptive matched filter according to claim 14 wherein the filter means for weighting is comprised of means for generating a dot product from the input data vector and a weight vector.

Claim 20

Dependent Claim 47 words

The adaptive matched filter according to claim 15 wherein the signal-only component of the output of a signal replica filter is represented by the product of an ensemble average matrix of the signal component of the input signal and a coefficient vector of the signal replica filter.

Claim 21

Dependent Claim 103 words

The adaptive matched filter according to claim 16 wherein the means for iteratively adapting is comprised of: a first means for cross-multiplying the input data vector with the weighted input data vector: means for for generating a difference between the first cross-product the ensemble average matrix multiplied by the coefficient vector; second means for cross-multiplying the difference by a scaler quantity representing a rate of adaption of the iteration; means for delaying for a predeterimined period the second cross-product; means for summing the delayed second cross-product with a weight vector delayed for a predetermined time, where the sum is an adapted weight vector.

Claim 22

Dependent Claim 46 words

The adaptive matched filter according to claim 12 wherein the filter means comprises: means for weighting a filter input comprised of a block of symbols on a symbol block-by-symbol block basis; and means for iteratively adapting the means for weighting on a symbol block-by-symbol block basis.

Claim 23

Dependent Claim 44 words

The adaptive matched filter according to claim 18 wherein the means for iteratively adapting minimizes a sum of mean squared estimation errors between the weighted filter input and the signal only component of the output of a signal replica filter over a symbol block.

Claim 24

Dependent Claim 34 words

The adaptive matched filter according to claim 19 wherein the means for iteratively adapting iteratively adapts the means for weighting substantially in accordance with a block "Griffiths" update process utilizing a Griffiths stochastic gradient.

Claim 25

Dependent Claim 28 words

The adaptive matched filter according to claim 20 wherein the means for weighting comprises: a plurality of signal-synchronous subfilters; and means for summing the outputs of the subfilters.

Claim 26

Dependent Claim 25 words

The adaptive matched filter according to claim 21 wherein a signal-synchronous subfilter is comprised of a fast Fourrier transform operator coupled to the filter input.

Claim 27

Independent Claim 71 words

A method of filtering bauded information signals having undefined noise components comprising: weighting an input signal bearing bauded information and noise, with an adaptive filter when the symbol of interest is justified within the adaptive filter; and adapting by iteration the weighting of the adaptive filter on a symbol-by-symbol basis such that the weighted input signal is an estimate of a signal-only component of an output of a signal replica filter.

Claim 28

Independent Claim 71 words

A method of filtering bauded information signals having undefined noise components comprising: weighting an input signal bearing bauded information and noise, with an adaptive filter when the symbol of interest is justified within the adaptive filter; and adapting by iteration the weighting of the adaptive filter on a symbol-by-symbol basis such that the weighted input signal is an estimate of a signal-only component of an output of a signal replica filter.

Claim 29

Dependent Claim 50 words

The method of filtering according to claim 23 wherein the step of weighting the input signal is comprised of the steps of: synchronously sampling the input signal at a multiple integral of the baud rate; and weighting with the adaptive filter a symbol-justified input data vector comprised of the samples.

Claim 30

Dependent Claim 46 words

The method of filtering according to claim 24 wherein the step of weighting the input signal is comprised of the step of multiplying the input data vector with a weight vector, to produce a scalar filter output, the scalar filter output being the weighted input signal.

Claim 31

Dependent Claim 61 words

The method of filtering a bauded information signal according to claim 23 wherein the step of adapting by iteration the weighting is comprised of the step of adapting the weight vector according to a "Griffiths" iteration process to minimize the least mean squared error between the scaler filter output and a signal-only component of an output of a signal replica filter.

Claim 32

Independent Claim 105 words

A method for filtering bauded information signals having undefined noise components comprising: sampling baud-synchronously an input signal having bauded information and undefined noise at a multiple integral of the baud rate; forming a filter input comprising a symbol-justified block of samples for a plurality of symbols; weighting the filter input on a block-by-block basis with an adaptive filter when the symbol of interest is justified in the adaptive filter; and adapting by iteration the weighting of the adaptive filter on a block-by-block basis such that the weighted input signal is an estimate of a signal-only component of an output of a predetermined signal replica filter.

Claim 33

Independent Claim 105 words

A method for filtering bauded information signals having undefined noise components comprising: sampling baud-synchronously an input signal having bauded information and undefined noise at a multiple integral of the baud rate; forming a filter input comprising a symbol-justified block of samples for a plurality of symbols; weighting the filter input on a block-by-block basis with an adaptive filter when the symbol of interest is justified in the adaptive filter; and adapting by iteration the weighting of the adaptive filter on a block-by-block basis such that the weighted input signal is an estimate of a signal-only component of an output of a predetermined signal replica filter.

Claim 34

Dependent Claim 43 words

The method of filtering bauded information signals according to claim 27 wherein the step of adapting by iteration minimizes the block mean squared error (BMSE) between the weighted filter input and the signal-only component of the output of the predetermined signal replica filter.

Claim 35

Dependent Claim 28 words

The method for filtering bauded information signals having undefined noise components according to claim 28 wherein the BMSE is minimized in substantial accordance with the "Griffith's" iteration process.

Claim 36

Dependent Claim 55 words

The method for filtering bauded information signals according to claim 27 wherein the step of generating a filter input is comprised of the step of commutating successive samples comprising a symbol to each of a plurality of signal-synchronous adaptive subfilters comprising the adaptive filter, the number of subfilters equaling the number of samples per symbol.

Claim 37

Dependent Claim 49 words

The method for filtering bauded information signals according to claim 30 wherein the step of weighting is comprised of the steps of: weighting with the subfilter a data vector comprised of a predetermined number of commutated samples; summing the weighted vectors from each subfilter to form a filter output.

Claim 38

Dependent Claim 59 words

The method for filtering bauded information signals having undefined noise components according to claim 31 wherein the step of weighting with the subfilter is comprised of the steps of: transforming in each subfilter the data vector of commutated samples with a discrete Fourrier transform (DFT) operator; and cross-multiplying the frequency domain data vector by a frequency domain weight vector.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1996-09-20	1997-03-22	1997-09-21	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2000-09-20	2001-03-22	2001-09-21	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2004-09-20	2005-03-22	2005-09-21	$7700.00	Window Closed / Lapsed

Method and apparatus for estimating signal components of a filter output

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag