US5220327A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decimation filter in a sigma-delta analog-to-digtal converter
Assignee: International Business Machines Corp
•
Filing: 1992-05-04
•
Granted: 1993-06-15
•
Expires: 2012-05-04
Abstract
Abstract A decimation filter for converting a train of sigma-delta pulses S(i) in synchronism with a sigma-delta clock (fs) into a train of PCM samples which includes counters (321, 331, 341) driven by the sigma-delta clock (fs) and which is continuously incremented by one during N sigma-delta clock pulses, then decremented by two during N following sigma-delta clock pulses and then incremented again by one during N following sigma-delta clock pulses in order to provide a sequence of incrementation parameter DELTA(n). The decimation filter further includes storages (320, 330, 340) for storing the value of the coefficient C(n) corresponding to the decimation filter transfer function, and incrementers (327, 337, 347) driven by the sigma-delta clock fs for incrementing the storages with the incrementation parameter DELTA(n). Finally, the decimation filter includes computers (323, 333, 343, 327, 337, 347) for deriving from the contents C(n) of said storages and from the train of input sigma-delta samples S(i+n) one Pulse Code Modulation (PCM) sample every 3×N input sigma-delta samples according to the formula: ##EQU1##
Inventors
- 👤 Jean-Claude Abbiate
- 👤 Alain Blanc
- 👤 Patrick Jeanniot
- 👤 Gerard Orengo
- 👤 Gerard Richter
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 23:30
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/06; H03H17/0614; H03H17/0621; H03H17/0635; H03H17/065; H03H17/0664
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
203 words
Decimation filter for converting a train of sigma-delta sample pulses S(i) in synchronism with a sigma-delta clock (fs) into a train of Pulse Code Modulation (PCM) samples in accordance with the formula ##EQU9## where Cn is the sequence of the coefficients of the decimation filter which corresponds to a determined decimation factor N, characterized in that it includes: computing means (350, 360, 370) further including: counting means (321, 331, 341) driven by said sigma-delta clock (fs) and which is continuously incremented by one during N sigma-delta clock pulses, then decremented by two during N following sigma-delta clock pulses and then incremented again by one during N following sigma-delta clock pulses for generating a incrementation parameter (DELTA(n)), storing means (320, 330, 340) for storing the value of the coefficient C(n) of said decimation filter to be multiplied by the next input sample S(i+n) to be processed, means (327, 337, 347) active every sigma-delta clock period for incrementing said storing means (320, 330, 340) with said incrementation parameter (DELTA(n)), means (323, 327) for deriving from the contents C(n) of said storing means (320, 330, 340) and from the train of input sigma-delta samples S(i+n) one Pulse Code Modulation (PCM) sample every 3×N input sigma-delta samples.
Claim 2
Dependent Claim
203 words
Decimation filter for converting a train of sigma-delta sample pulses S(i) in synchronism with a sigma-delta clock (fs) into a train of Pulse Code Modulation (PCM) samples in accordance with the formula ##EQU9## where Cn is the sequence of the coefficients of the decimation filter which corresponds to a determined decimation factor N, characterized in that it includes: computing means (350, 360, 370) further including: counting means (321, 331, 341) driven by said sigma-delta clock (fs) and which is continuously incremented by one during N sigma-delta clock pulses, then decremented by two during N following sigma-delta clock pulses and then incremented again by one during N following sigma-delta clock pulses for generating a incrementation parameter (DELTA(n)), storing means (320, 330, 340) for storing the value of the coefficient C(n) of said decimation filter to be multiplied by the next input sample S(i+n) to be processed, means (327, 337, 347) active every sigma-delta clock period for incrementing said storing means (320, 330, 340) with said incrementation parameter (DELTA(n)), means (323, 327) for deriving from the contents C(n) of said storing means (320, 330, 340) and from the train of input sigma-delta samples S(i+n) one Pulse Code Modulation (PCM) sample every 3×N input sigma-delta samples.
Claim 3
Dependent Claim
55 words
Filtering and decimation device according to claim 1 characterized in that: it includes three computing means (350, 360, 370) respectively driven by a set of three phase-delayed clocks derived from said sigma-delta clock (fs), each of said computing means (350, 360, 370) computing one PCM sample from a sequence of 3×N consecutive input sigma-delta pulses.
Claim 4
Dependent Claim
139 words
Filtering and decimation device according to claim 1 or 2 characterized in that: said counting means (321, 331, 341) has a control lead and performing a incrementation by one when said control lead is at a first logical level and conversely for performing a decrementation by two when said control lead is at a second logical level, and that each of said three computing means (350, 360, 370) includes: a first register (320, 330, 340) for storing the value C(n) of the coefficient to be multiplied by the next sigma-delta input sample S(i+n), adding means (327, 337, 347) active every sigma-delta clock period for adding the contents of said counting means with the contents of said first register (320, 330, 340) in order to compute the following coefficient C(n+1) to be loaded into said first register (320, 330, 340).
Claim 5
Dependent Claim
70 words
Filtering and decimation device according to claim 3 characterized in that each of said three computing means (350, 360, 370) further includes multiplying means (323, 333, 343) connected to said first register (320, 330, 340) and receiving said train of sigma-delta pulses for computing at every period of the sigma-delta clock (fs) the product C(n)×S(i+n), a second register (322, 332, 342) continuously incremented by the result of said multiplying means.
Claim 6
Dependent Claim
53 words
Filtering and decimation device according to claim 4 characterized in that in each of said three computing means (350, 360, 370), said adding means (327, 337, 347) is also used for computing the new coefficient C(n+1) stored into said first register (320, 330, 340) and for incrementing said second register (322, 332, 342).
Claim 7
Dependent Claim
215 words
Filtering and decimation device according to claim 5 characterized in that each of said three computing means (350, 360, 370) further includes multiplexing means (324, 334, 344) having a first input bus connected to the output bus of said second register (322, 332, 342) and a second input bus connected to the output of said counting means (321, 331, 341), said multiplexing means being controlled by said sigma-delta clock, XOR gating means (323, 333, 343) having one input connected to the output of a AND gate (326, 336, 346) receiving the input train of sigma-delta pulses and also the sigma-delta clock, said XOR gating means (323, 333, 343) having a second input bus connected to the output bus of said first register (320, 330, 340), and that said adding means (327, 337, 347) has a first input bus connected to the output of said multiplexing means and a second input bus connected to the output of said XOR gating means (323, 333, 343), the output bus of said adding means being connected to the input of said first and said second register, whereby said adding means performs the computation of c(n)+DELTA(i) during one half of said sigma-delta clock period and the update of said second register during the second half of said sigma-delta clock period.
Claim 8
Dependent Claim
100 words
An analog-to-digital converter including a sigma-delta converter and further characterized in that said sigma-delta converter includes: a threshold device (222) for generating an output and feedback signal, a filter (214, 220) receiving the analog input signal to be converted and said output and feedback signal by means of at least one feedback loop, means (215, 221) located in said at least one feedback loop for performing a return-to-specified-logical-state of the sigma-delta code generated by said threshold device at every period of the sigma-delta clock thereby making the sigma-delta converter insensitive to the rise and fall time of the threshold device.
Claim 9
Dependent Claim
100 words
An analog-to-digital converter including a sigma-delta converter and further characterized in that said sigma-delta converter includes: a threshold device (222) for generating an output and feedback signal, a filter (214, 220) receiving the analog input signal to be converted and said output and feedback signal by means of at least one feedback loop, means (215, 221) located in said at least one feedback loop for performing a return-to-specified-logical-state of the sigma-delta code generated by said threshold device at every period of the sigma-delta clock thereby making the sigma-delta converter insensitive to the rise and fall time of the threshold device.
Claim 10
Dependent Claim
120 words
Analog-to-digital converter according to claim 7 characterized in that said sigma-delta converter further includes: a first integrator (214, 213, 211, 212) receiving said analog input signal to be converted and a first feedback signal coming from a first feedback loop, a second integrator (220, 217, 218, 219) receiving the analog output of said first integrator and a second feedback signal coming from a second feedback loop and having an output lead connected to said threshold device, first means (215, 208) for performing a return-to-zero of the feedback signal conveyed through said first feedback loop to said first integrator, second means (221, 208) for performing a return-to-zero of the feedback signal conveyed through said second feedback loop to said second integrator.
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) | 1996-06-14 | 1996-12-14 | 1997-06-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-06-14 | 2000-12-14 | 2001-06-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-06-14 | 2004-12-14 | 2005-06-15 | $7700.00 | Window Closed / Lapsed |