Patent EP0196113A2 successfully refreshed from Google Patents.
Patent US5142349A successfully refreshed from Google Patents.
Patent US1049676A successfully refreshed from Google Patents.
Patent US4521866A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4521866A Expired / Lapsed US ⏱️ 0.0 years remaining

Distributed arithmetic oversampling recursive digital filter

Assignee: Individual
•
Filing: 1981-08-17
•
Granted: 1985-06-04
•
Expires: 2001-08-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Distributed arithmetic oversampling recursive digital filter comprising a recursive part constituted by q registers of a circulating nature, a non-recursive part of order p constituted by series registers, a memory divided into N memory blocks, a modulo N counter with alpha outputs, an adder-subtracter connected to the memory, an accumulator register, and a frequency clock fs. The filter is characterized in that the non-recursive part only comprises K series registers, K being an integer defined by the double inequality: (K-1)N+2 alpha -N</=p+P-1</=KN+2 alpha -N and in that it comprises multiplexers able to make these K registers recirculating N-1 times out of N and circulating 1 time out of N, these multiplexers being controlled by the outputs of the counter.

Inventors

  • 👤 Jean-Pierre Petit
  • 👤 Xavier Maitre

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 15:12
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/0223; H03H17/0238; H03H17/0241; H03H17/04; H03H17/0416; H03H17/0427; H03H17/0438; H03H17/0444

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 556 words
A distributed arithmetic oversampling recursive digital filter, comprising: (a) a recursive part of order q comprising a parallel loading register having an output terminal and an input terminal, and q-1 series registers each of r cells, r being an integer connected in cascade; (b) a non-recursive part of order p comprising series registers each of r cells each series register having one input terminal receiving input signals, said input signals being blockable P times out of N, wherein P and N are integers; (c) a modulo N counter with α output terminals; (d) a memory divided into N memory blocks, each of said memory blocks containing a set of calculated quantities characterizing the filtering to be carried out, said memory having α addressing input terminals corresponding to said blocks, said addressing input terminals being connected to said α outputs of said modulo N counter and said addressing input terminals within a block being connected to the output terminals of said series registers of said recursive and said non-recursive parts and said memory having an output terminal; (e) an adder-subtracter having an input terminal connected to the output terminal of said memory and having an output terminal; (f) an accumulator register having an input terminal connected to said output terminal of said adder-subtracter and having an output terminal connected to said input terminal of said parallel loading register and to said input terminal of said adder-subtracter; (g) a clock having a first output terminal connected to said parallel loading register and said series registers, said first output terminal delivering a clock signal at a frequency rf s , and a second output terminal connected to said modulo N counter, said second output terminal delivering a clock signal at a frequency f s , said filter having an input terminal for receiving samples at a sampling frequency f E , said frequency f s of said clock being equal to Nf E , said non-recursive part comprising at most K+1 series registers, K being an integer defined by the relationship (K-1) N+2.sup.α -N≦p+P-1<KN+2.sup.α -N, and wherein said filter further comprises a first plurality of first through Kth multiplexers each having first and second input terminals, a control input terminal and an output terminal, said output terminal of each said multiplexer being operatively connected to either said first or second input terminals according to a signal supplied to said control input signal, said second input terminal of each of said multiplexers being connected to the output terminal of an associated one of said series registers, said first input terminal of the jth multiplexer, j being an integer, 1<j≦K, being connected to the output terminal of that one of said series registers associated with the (j-1)-th multiplexer said first input terminal of said first multiplexer being connected to said input of said filter, and said control input terminal of said j-th multiplexer being controlled by said modulo N counter in such a way that when the content of said modulo N counter is at a maximum, said output terminal of said j-th multiplexer is operatively connected to said first input terminal of said j-th multiplexer, thereby making said series registers circulating, and when the content of said modulo N counter differs from its maximum output, said output terminal of said j-th multiplexer, is operatively connected to said second input terminal.
Claim 2
Dependent Claim 556 words
A distributed arithmetic oversampling recursive digital filter, comprising: (a) a recursive part of order q comprising a parallel loading register having an output terminal and an input terminal, and q-1 series registers each of r cells, r being an integer connected in cascade; (b) a non-recursive part of order p comprising series registers each of r cells each series register having one input terminal receiving input signals, said input signals being blockable P times out of N, wherein P and N are integers; (c) a modulo N counter with α output terminals; (d) a memory divided into N memory blocks, each of said memory blocks containing a set of calculated quantities characterizing the filtering to be carried out, said memory having α addressing input terminals corresponding to said blocks, said addressing input terminals being connected to said α outputs of said modulo N counter and said addressing input terminals within a block being connected to the output terminals of said series registers of said recursive and said non-recursive parts and said memory having an output terminal; (e) an adder-subtracter having an input terminal connected to the output terminal of said memory and having an output terminal; (f) an accumulator register having an input terminal connected to said output terminal of said adder-subtracter and having an output terminal connected to said input terminal of said parallel loading register and to said input terminal of said adder-subtracter; (g) a clock having a first output terminal connected to said parallel loading register and said series registers, said first output terminal delivering a clock signal at a frequency rf s , and a second output terminal connected to said modulo N counter, said second output terminal delivering a clock signal at a frequency f s , said filter having an input terminal for receiving samples at a sampling frequency f E , said frequency f s of said clock being equal to Nf E , said non-recursive part comprising at most K+1 series registers, K being an integer defined by the relationship (K-1) N+2.sup.α -N≦p+P-1<KN+2.sup.α -N, and wherein said filter further comprises a first plurality of first through Kth multiplexers each having first and second input terminals, a control input terminal and an output terminal, said output terminal of each said multiplexer being operatively connected to either said first or second input terminals according to a signal supplied to said control input signal, said second input terminal of each of said multiplexers being connected to the output terminal of an associated one of said series registers, said first input terminal of the jth multiplexer, j being an integer, 1<j≦K, being connected to the output terminal of that one of said series registers associated with the (j-1)-th multiplexer said first input terminal of said first multiplexer being connected to said input of said filter, and said control input terminal of said j-th multiplexer being controlled by said modulo N counter in such a way that when the content of said modulo N counter is at a maximum, said output terminal of said j-th multiplexer is operatively connected to said first input terminal of said j-th multiplexer, thereby making said series registers circulating, and when the content of said modulo N counter differs from its maximum output, said output terminal of said j-th multiplexer, is operatively connected to said second input terminal.
Claim 3
Dependent Claim 48 words
A filter according to claim 1, wherein N is not equal to 2 to the α power and said non-recursive part comprises a (K+1)th series register multiplexed with an output (α o ) of said module N counter able to supply a non-significant bit for addressing said memory.
Claim 4
Dependent Claim 62 words
A filter according to claim 1, further comprising a second plurality of multiplexers and a module M counter, wherein said memory is preceeded by said second plurality of multiplexers each with M input terminals connected to said series registers, said multiplexers being controlled by said module M counter having output terminals which are connected to said addressing input terminals of said memory.
Claim 5
Dependent Claim 71 words
A filter according to claim 3, wherein M is not equal to 2 to the β power, β being an integer, and said second plurality of multiplexers are 2.sup.β -M in number, each of said multiplexers having two further input terminals, with one of said further input terminals being connected to one of said output terminals of said modulo M counter able to supply a non-significant bit for addressing said memory.

References Cited (Backward Citations)

US3777130A Cited
US3988607A Cited
US4020332A Cited
US4146931A Cited
US4337518A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag