US5040137A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Random access FIR filtering
Assignee: AUDIO ANIMATION A DE CORP
•
Filing: 1989-12-13
•
Granted: 1991-08-13
•
Expires: 2009-12-13
Abstract
Abstract A finite impulse response filter that has the ability to use arbitrary TAPs that are essentially random access TAPs includes a plurality of circuits. The samples it operates on do not need to be a contiguous form. A sequencer is provided for counting up to a programmable number each time a start pulse is encountered and to provide an address and an incrementing address to a delta RAM, a coefficient RAM, and a micro code RAM. The delta RAM is used for storing the number of the TAP that is to be accessed. Delta Adders that directly follow the delta RAM are used with an input counter for making a ring counter for the input samples. A first and second sample RAM are used to hold incoming samples. An adder circuit is used for adding the output of the two sample RAMs to provide an output signal. A multiplier accumulator is connected to the adder circuit for receiving the output signal. The sequencer provides all the timing for the different cycles of the multiplier accumulator. After a programmed amount of samples have been added together, the multiplier accumulator outputs its value onto an input/output bus, where all the input and output samples either originate or end.
Inventors
- 👤 James V. Sherrill
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 15:10
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/06
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
165 words
A finite impulse response filter comprising: interface means for receiving unfiltered digital data samples; first memory means for storing said unfiltered digital data samples; counter means for providing a count value; second memory means for storing TAP access information; third memory means for storing predetermined coefficient values; combining means connected to said counter means and said second memory means and to said first memory means for combining said count value and said TAP access information to produce first and second address signals used as address signals for storage of the digital data samples in said first memory means; adder means connected to said first memory means for receiving and adding digital data samples stored in said first memory means at addresses defined by said first and second address signals to produce a sum sample signal; and multiplier means connected to said adder means and said third memory means for multiplying said sum sample signal by a predetermined coefficient value stored in said third memory means.
Claim 2
Dependent Claim
165 words
A finite impulse response filter comprising: interface means for receiving unfiltered digital data samples; first memory means for storing said unfiltered digital data samples; counter means for providing a count value; second memory means for storing TAP access information; third memory means for storing predetermined coefficient values; combining means connected to said counter means and said second memory means and to said first memory means for combining said count value and said TAP access information to produce first and second address signals used as address signals for storage of the digital data samples in said first memory means; adder means connected to said first memory means for receiving and adding digital data samples stored in said first memory means at addresses defined by said first and second address signals to produce a sum sample signal; and multiplier means connected to said adder means and said third memory means for multiplying said sum sample signal by a predetermined coefficient value stored in said third memory means.
Claim 3
Dependent Claim
47 words
The finite impulse response filter according to claim 1, and further comprising: fourth memory means for storing control codes to govern data flow; and sequencer means connected to said fourth memory means for controlling said second memory means and said third memory means through said control codes.
Claim 4
Dependent Claim
34 words
The finite impulse response filter according to claim 2, wherein said first memory means includes a first memory for storing selected values and a second memory for storing values symmetrical to said selected values.
Claim 5
Independent Claim
114 words
A method for filter digital data signals comprising the steps of: receiving unfiltered digital data samples; storing said unfiltered digital data samples in a first memory; providing a count value; storing TAP access information in a second memory; storing predetermined coefficient values in a third memory; combining said count value and said TAP access information to produce first and second address signals used for storage of digital data samples in said first memory; adding digital data samples stored at addresses in said first memory defined by said first and said address signals to produce a sum sample signal; and multiplying said sum sample signal by a predetermined coefficient value stored in the third memory.
Claim 6
Independent Claim
114 words
A method for filter digital data signals comprising the steps of: receiving unfiltered digital data samples; storing said unfiltered digital data samples in a first memory; providing a count value; storing TAP access information in a second memory; storing predetermined coefficient values in a third memory; combining said count value and said TAP access information to produce first and second address signals used for storage of digital data samples in said first memory; adding digital data samples stored at addresses in said first memory defined by said first and said address signals to produce a sum sample signal; and multiplying said sum sample signal by a predetermined coefficient value stored in the third memory.
Claim 7
Dependent Claim
221 words
A finite impulse response filter comprising: interface mans for receiving unfiltered digital data samples; first memory means for storing said unfiltered digital data samples, said first memory means comprising a first memory for storing selected values and a second memory for storing values symmetrical to said selected values; counter means for providing a count value; second memory means for storing TAP access information; third memory means for storing predetermined coefficient values; combining means connected to said counter means and said second memory means and to said first memory means for combining said count value and said TAP access information to produce first and second address signals used for storage of the digital data samples in said first memory means; adder means connected to said first memory means for receiving and adding digital data samples stored in said first memory means at addresses defined by said first and second address signals to produce a sum sample signal; and multiplier means connected to said adder means and said third memory means for multiplying said sum sample signal by a predetermined coefficient value stored in said third memory means; fourth memory means for storing control codes to govern data flow; and sequencer means connected to said fourth memory means for controlling said second memory means and said third memory means through said control codes.
Claim 8
Dependent Claim
221 words
A finite impulse response filter comprising: interface mans for receiving unfiltered digital data samples; first memory means for storing said unfiltered digital data samples, said first memory means comprising a first memory for storing selected values and a second memory for storing values symmetrical to said selected values; counter means for providing a count value; second memory means for storing TAP access information; third memory means for storing predetermined coefficient values; combining means connected to said counter means and said second memory means and to said first memory means for combining said count value and said TAP access information to produce first and second address signals used for storage of the digital data samples in said first memory means; adder means connected to said first memory means for receiving and adding digital data samples stored in said first memory means at addresses defined by said first and second address signals to produce a sum sample signal; and multiplier means connected to said adder means and said third memory means for multiplying said sum sample signal by a predetermined coefficient value stored in said third memory means; fourth memory means for storing control codes to govern data flow; and sequencer means connected to said fourth memory means for controlling said second memory means and said third memory means through said control codes.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-08-12 | 1995-02-11 | 1995-08-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-08-12 | 1999-02-11 | 1999-08-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-08-12 | 2003-02-11 | 2003-08-13 | $7700.00 | Window Closed / Lapsed |