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

Pipelined digital filters

Assignee: University of California Berkeley
•
Filing: 1984-03-26
•
Granted: 1985-01-22
•
Expires: 2004-03-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A digital filter having a recursive portion and a non-recursive portion. The digital filter is implemented using pipelining techniques and parallel arithmetic and parallel arithmetic in both portions.

Inventors

  • 👤 Herschel H. Loomis, Jr.

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 22:38
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/0283; H03H17/0286; H03H17/0288

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 281 words
An improvement in a digital filter having a non-recursive portion and a recursive portion, wherein said digital filter has a function y=a o x+a 1 D 1 x+a 2 D 2 x+. . . a m D m x-(b 1 D 1 +. . . +b n D n y), in which the terms containing a m represent the non recursive portion and a o , a 1 . . . a m are constants, the terms containing b 1 . . . b n represent the recursive portion and b 1 . . . b n are constants, and D m and D n are delay operators, and wherein said digital filter operates at a clock frequency f s , said clock frequency f s also being the frequency at which an input signal x to said digital filter has been sampled, said non-recursive portion and said recursive portion each having at least one 1-stage parallel multiply-add means with one stage for multiplying digital signals by said constants and for adding two digital signals and for delaying digital signals by one clock period, wherein the improved digital filter comprises: (a) said parallel multiply-add means in said recursive portion including parallel pipeline multiply-add means with more than one stage for multiplying digital signals by said constants and for adding two digital signals. (b) said improved digital filter providing a higher order function which is operationally the same as said function y but delayed by a number D of sample times; and (c) said improved digital filter being operable at a clock frequency which is greater than f s and determined by the number of stages in said parallel pipeline multiply-add means.
Claim 2
Dependent Claim 281 words
An improvement in a digital filter having a non-recursive portion and a recursive portion, wherein said digital filter has a function y=a o x+a 1 D 1 x+a 2 D 2 x+. . . a m D m x-(b 1 D 1 +. . . +b n D n y), in which the terms containing a m represent the non recursive portion and a o , a 1 . . . a m are constants, the terms containing b 1 . . . b n represent the recursive portion and b 1 . . . b n are constants, and D m and D n are delay operators, and wherein said digital filter operates at a clock frequency f s , said clock frequency f s also being the frequency at which an input signal x to said digital filter has been sampled, said non-recursive portion and said recursive portion each having at least one 1-stage parallel multiply-add means with one stage for multiplying digital signals by said constants and for adding two digital signals and for delaying digital signals by one clock period, wherein the improved digital filter comprises: (a) said parallel multiply-add means in said recursive portion including parallel pipeline multiply-add means with more than one stage for multiplying digital signals by said constants and for adding two digital signals. (b) said improved digital filter providing a higher order function which is operationally the same as said function y but delayed by a number D of sample times; and (c) said improved digital filter being operable at a clock frequency which is greater than f s and determined by the number of stages in said parallel pipeline multiply-add means.
Claim 3
Dependent Claim 32 words
An improved digital filter according to claim 1, wherein each stage of said parallel pipeline multiply-add means comprises a multiplier and an adder, in which either or both have a pipeline implementation.
Claim 4
Dependent Claim 50 words
An improved digital filter according to claim 1, wherein said recursive portion implementing said function y has a feedback path having a minimum delay D of 1 sample time and wherein said recursive portion implementing said higher order function has a minimum delay D of more than one sample time.
Claim 5
Dependent Claim 32 words
An improved digital filter according to claim 3, wherein said minimum delay D is dependent on the degree of pipelining and the topology of said recursive portion implementing said higher order function.
Claim 6
Dependent Claim 20 words
An improved digital filter according to claim 1, wherein said parallel pipeline multiply-add means comprises at least a 2-stage multiplier-adder.
Claim 7
Dependent Claim 19 words
An improved digital filter according to claim 5, wherein said 2-stage multiplier-adder comprises a 1-stage multiplier and 2stage adder.
Claim 8
Dependent Claim 215 words
A digital filter performing a function defined by the p-order equation, y=(a o x+a 1 D 1 x+a 2 D 2 x+. . . a n D n x)-(b 1 D 1 +b 2 D 2 y+ . . . b m D m y) in which the terms containing coefficients a o , a 1 . . . a n define the non-recursive portion, and the terms containing the coefficients b o , b 1 . . . b m define the recursive portion, and D m and D n are delay operators, where p equals the greater of m or n, said digital filter comprising: recursive means for parallel pipeline implementation of the recursive portion including a plurality of feedback loops, said plurality of feedback loops having a minimum number q greater than one of pipeline stages and corresponding to the terms of the recursive portion; non-recursive means for parallel pipeline implementation of the non-recursive portion including a plurality of pipeline paths; said plurality of pipeline paths having a minimum of said number q of pipeline stages and corresponding to the terms of the non-recursive portion; output means for combining said recursive means and said non-recursive means to implement a (p+q)-order difference equation having an output equivalent to the p-order difference equation y.
Claim 9
Dependent Claim 215 words
A digital filter performing a function defined by the p-order equation, y=(a o x+a 1 D 1 x+a 2 D 2 x+. . . a n D n x)-(b 1 D 1 +b 2 D 2 y+ . . . b m D m y) in which the terms containing coefficients a o , a 1 . . . a n define the non-recursive portion, and the terms containing the coefficients b o , b 1 . . . b m define the recursive portion, and D m and D n are delay operators, where p equals the greater of m or n, said digital filter comprising: recursive means for parallel pipeline implementation of the recursive portion including a plurality of feedback loops, said plurality of feedback loops having a minimum number q greater than one of pipeline stages and corresponding to the terms of the recursive portion; non-recursive means for parallel pipeline implementation of the non-recursive portion including a plurality of pipeline paths; said plurality of pipeline paths having a minimum of said number q of pipeline stages and corresponding to the terms of the non-recursive portion; output means for combining said recursive means and said non-recursive means to implement a (p+q)-order difference equation having an output equivalent to the p-order difference equation y.

References Cited (Backward Citations)

US3829670A Cited
US3955193A Cited
US4317092A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-01-22 1988-07-23 1989-01-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-01-22 1992-07-23 1993-01-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-01-22 1996-07-23 1997-01-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag