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

Method and apparatus for processing sampled data signals by utilizing preconvolved quantized vectors

Assignee: Brigham Young University
•
Filing: 1988-02-17
•
Granted: 1990-12-11
•
Expires: 2008-02-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An electronic system for processing sampled data input signals includes an electronic memory which stores a set of preprocessed vectors V 1 f(m, . . . ) thru V N *f(m, . . . ) where f(m, . . . ) is a sampled data function, having any number of dimensions m, . . . . * is a convolution operator, and V 1 thru V N are a finite set of N unprocessed vectors each of which represents an anticipated group of input signal samples. After these preprocessed vectors are stored, input signals are processed in real time by (a) a circuit which samples the input signal; (b) a circuit which compresses the sequence of samples that is taken into a smaller sequence of index signals that correspond to the indexes 1 thru N of the unprocessed vectors; (c) a circuit which receives the smaller sequence of index signals and reads from the memory those preprocessed vectors whose indexes match the received index signals; and (d) a circuit which adds together the read preprocessed vectors while maintaining a predetermined offset between them as they are added.

Inventors

  • 👤 Douglas M. Chabries
  • 👤 Richard W. Christiansen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 19:47
CPC Classifications
G; G01; G01S; G01S13/00; G01S13/88; G01S13/89; G01S13/90; G01S13/9004; G01S13/9017

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 181 words
An electronic system for processing sampled data input signals, which is comprised of: an electronic memory means which stores a set of preprocessed vectors V 1 *f(m, . . . ) thru V n *f(m, . . . ) where f(m, . . . ) is a sampled data function having any number of dimensions m, . . . , * is a convolution operator, and V 1 thru V N are a finite set of N unprocessed vectors each of which represents an anticipated group of input signal samples; a means for generating a sequence of samples from an input signal that is to be processed and for compressing said sequence of samples into a smaller sequence of index signals that correspond to the indexes 1 thru N of said unprocessed vectors; a means for receiving said smaller sequence of index signals and for reading form said memory means, those preprocessed vectors whose indexes match the received index signals; and, a means for adding together the read preprocessed vectors while maintaining a predetermined offset between them as they are added.
Claim 2
Dependent Claim 181 words
An electronic system for processing sampled data input signals, which is comprised of: an electronic memory means which stores a set of preprocessed vectors V 1 *f(m, . . . ) thru V n *f(m, . . . ) where f(m, . . . ) is a sampled data function having any number of dimensions m, . . . , * is a convolution operator, and V 1 thru V N are a finite set of N unprocessed vectors each of which represents an anticipated group of input signal samples; a means for generating a sequence of samples from an input signal that is to be processed and for compressing said sequence of samples into a smaller sequence of index signals that correspond to the indexes 1 thru N of said unprocessed vectors; a means for receiving said smaller sequence of index signals and for reading form said memory means, those preprocessed vectors whose indexes match the received index signals; and, a means for adding together the read preprocessed vectors while maintaining a predetermined offset between them as they are added.
Claim 3
Dependent Claim 25 words
A system according to claim 1 wherein said means for reading and said means for adding operate sequentially on one preprocessed vector at a time.
Claim 4
Dependent Claim 26 words
A system according to claim 1 wherein said means for reading and said means for adding operate in parallel on multiple preprocessed vectors at a time.
Claim 5
Dependent Claim 18 words
A system according to claim 1 wherein the number of preprocessed vectors ranges from sixteen to ten thousand.
Claim 6
Dependent Claim 26 words
A system according to claim 1 wherein said predetermined offset which is maintained between the preprocessed vectors equals the size and shape of an unprocessed vector.
Claim 7
Dependent Claim 26 words
A system according to claim 1 wherein said sampled data function f(m, . . . ) is from ten to fifty thousand data points in size.
Claim 8
Dependent Claim 20 words
A system according to claim 1 wherein said sampled data function includes the sampled impulse response of a range filter.
Claim 9
Dependent Claim 20 words
A system according to claim 1 wherein said sampled data function includes the sampled impulse response of an azimuth filter.
Claim 10
Dependent Claim 54 words
A system according to claim 1 wherein said sampled data function is of a form f 1 (m)f 2 (n), and wherein f 1 (m) is convolved by row with each vector V 1 thru V n while f 2 (n) is convolved by column with each result from such f 1 (m) convolution.
Claim 11
Dependent Claim 29 words
A system according to claim 1 wherein each of said unprocessed vectors V 1 thru V n approximates from two samples to one hundred samples of said input signal.
Claim 12
Dependent Claim 18 words
A system according to claim 1 wherein said input signal is a return signal of a radar pulse.
Claim 13
Dependent Claim 26 words
A system according to claim 11 wherein said predetermined offset which is maintained between the preprocessed vectors equals the size and shape of an unprocessed vector.
Claim 14
Dependent Claim 54 words
A system according to claim 12 wherein said sampled data function is of a form f 1 (m)f 2 (n), and wherein f 1 (m) is convolved by row with each vector V 1 thru V N while f 2 (n) is convolved by column with each result from such f 1 (m) convolution.
Claim 15
Dependent Claim 23 words
A system according to claim 13 wherein said sampled data function f 1 (m) is the sampled impulse response of a range filter.
Claim 16
Dependent Claim 23 words
A system according to claim 14 wherein said sampled data function f 2 (n) is the sampled impulse response of an azimuth filter.
Claim 17
Dependent Claim 25 words
A system according to claim 15 wherein said means for reading and said means for adding operate sequentially on one preprocessed vector at a time.
Claim 18
Dependent Claim 26 words
A system according to claim 15 wherein said means for reading and said means for adding operate in parallel on multiple preprocessed vectors at a time.

References Cited (Backward Citations)

US4025920A Cited
US4200861A Cited
US4400828A Cited
US4776020A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-12-10 1994-06-11 1994-12-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-12-10 1998-06-11 1998-12-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-12-10 2002-06-11 2002-12-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag