US5666299A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Asynchronous digital sample rate converter
Assignee: Analog Devices Inc
•
Filing: 1995-05-19
•
Granted: 1997-09-09
•
Expires: 2015-05-19
Abstract
Abstract An asynchronous digital sample rate converter includes a random access memory for storing input data values and a read only memory for storing a reduced set of interpolation filter coefficients. Input data is written to the random access memory at the input sample rate. Output samples are provided from a multiply/accumulate engine which given a stream of input data and filter coefficients produces an output sample upon request at the output frequency. The initial address for reading input data from the random access memory, and the addresses for coefficients from the read only memory are provided by an auto-centering scheme which is a first order closed loop system with a digital integrator fed by an approximation of the input to output sample rate ratio. This auto-centering scheme may include a feed forward low pass filter to cancel steady state error, and an interpolated write address to reduce noise. A circuit determining the output to input sample rate ratios can also be provided to scale coefficient addresses and resulting output samples to allow for decimation. This circuit includes a form of digital hysteresis to eliminate noise. The ROM coefficients are reduced by relying on the symmetry of the impulse response of the interpolation filter and by utilizing a variable step size forward and backward linear interpolation.
Inventors
- 👤 Robert W. Adams
- 👤 Tom W. Kwan
- 👤 Michael Coln
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:25
CPC Classifications
H; H03; H03H; H03H17/00; H03H17/02; H03H17/06; H03H17/0621; H03H17/0628
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
213 words
A method for generating a desired filter coefficient of a digital filter, wherein each filter coefficient has a corresponding coefficient address in an address space defined by a number of taps of the digital filter, the method using a memory in which a plurality of coefficient values, less than the number of taps of the digital filter, are stored, wherein each pair of adjacent coefficient values stored in the memory define boundaries of a region including a plurality of addresses in the address space, and wherein at least one region has a number of addresses different from other regions, the method comprising the steps of: receiving a coefficient address in the address space and corresponding to the desired filter coefficient; determining the region including the coefficient address; selecting a stored coefficient value from the memory defining one boundary of the determined region; generating a difference value indicating a difference between the selected coefficient value and an adjacent coefficient value stored in the memory and defining another boundary of the determined region; generating a fractional value indicating a distance between the coefficient address and a coefficient address corresponding to the selected coefficient value; and generating the desired filter coefficient as a function of the selected coefficient value, the difference value and the fractional value.
Claim 2
Independent Claim
213 words
A method for generating a desired filter coefficient of a digital filter, wherein each filter coefficient has a corresponding coefficient address in an address space defined by a number of taps of the digital filter, the method using a memory in which a plurality of coefficient values, less than the number of taps of the digital filter, are stored, wherein each pair of adjacent coefficient values stored in the memory define boundaries of a region including a plurality of addresses in the address space, and wherein at least one region has a number of addresses different from other regions, the method comprising the steps of: receiving a coefficient address in the address space and corresponding to the desired filter coefficient; determining the region including the coefficient address; selecting a stored coefficient value from the memory defining one boundary of the determined region; generating a difference value indicating a difference between the selected coefficient value and an adjacent coefficient value stored in the memory and defining another boundary of the determined region; generating a fractional value indicating a distance between the coefficient address and a coefficient address corresponding to the selected coefficient value; and generating the desired filter coefficient as a function of the selected coefficient value, the difference value and the fractional value.
Claim 3
Dependent Claim
51 words
The process of claim 1, wherein the process further uses a difference memory containing difference values corresponding to each coefficient value in the memory, and wherein the step of generating the difference value comprises the step of: selecting the difference value from the difference memory corresponding to the selected coefficient value.
Claim 4
Dependent Claim
83 words
The process of claim 1, wherein the step of selecting a coefficient value from the memory comprises the steps of: mapping a number of the most significant bits of the coefficient address to provide a reduced coefficient address and a shift control output; shifting a number of the least significant bits of the coefficient address to provide a shifted output; and accessing the memory using the reduced coefficient address and most significant bits of the shifted output to obtain the selected coefficient value.
Claim 5
Dependent Claim
29 words
The process of claim 3, wherein the step of selecting the difference value includes the step of accessing the difference memory using most significant bits of the shifted output.
Claim 6
Dependent Claim
17 words
The process of claim 3, wherein the fractional value is least significant bits of the shifted output.
Claim 7
Dependent Claim
38 words
The process of claim 1, wherein the step of generating the difference value comprises steps of: selecting the adjacent coefficient value from the memory; and computing a difference between the adjacent coefficient value and the selected coefficient value.
Claim 8
Dependent Claim
83 words
The process of claim 6, wherein the step of selecting a coefficient value from the memory comprises the steps of: mapping a number of the most significant bits of the coefficient address to provide a reduced coefficient address and a shift control output; shifting a number of the least significant bits of the coefficient address to provide a shifted output; and accessing the memory using the reduced coefficient address and most significant bits of the shifted output to obtain the selected coefficient value.
Claim 9
Dependent Claim
17 words
The process of claim 7, wherein the fractional value is least significant bits of the shifted output.
Claim 10
Dependent Claim
83 words
The process of claim 1, wherein the step of selecting a coefficient value from the memory comprises the steps of: mapping a number of the most significant bits of the coefficient address to provide a reduced coefficient address and a shift control output; shifting a number of the least significant bits of the coefficient address to provide a shifted output; and accessing the memory using the reduced coefficient address and most significant bits of the shifted output to obtain the selected coefficient value.
Claim 11
Dependent Claim
17 words
The process of claim 9, wherein the fractional value is least significant bits of the shifted output.
Claim 12
Dependent Claim
220 words
A circuit for generating a desired filter coefficient of a digital filter, wherein each filter coefficient has a corresponding coefficient address in an address space defined by a number of taps of the digital filter, the circuit using a memory in which a plurality of coefficient values, less than the number of taps of the digital filter, are stored, wherein each pair of adjacent coefficient values stored in the memory define boundaries of a region including a plurality of addresses in the address space, and wherein at least one region has a number of addresses different from other regions, the circuit comprising: means for receiving a coefficient address in the address space and corresponding to the desired filter coefficient; means for determining the region including the coefficient address; means for selecting a stored coefficient value from the memory according to the determined region; means for generating a difference value indicating a difference between the elected coefficient value and an adjacent coefficient value stored in the memory and defining another boundary of the determined region; means for generating a fractional value indicating a distance between the coefficient address and a coefficient address corresponding to the selected coefficient value; and means for computing the desired filter coefficient as a function of the selected coefficient value, the difference value and the fractional value.
Claim 13
Dependent Claim
220 words
A circuit for generating a desired filter coefficient of a digital filter, wherein each filter coefficient has a corresponding coefficient address in an address space defined by a number of taps of the digital filter, the circuit using a memory in which a plurality of coefficient values, less than the number of taps of the digital filter, are stored, wherein each pair of adjacent coefficient values stored in the memory define boundaries of a region including a plurality of addresses in the address space, and wherein at least one region has a number of addresses different from other regions, the circuit comprising: means for receiving a coefficient address in the address space and corresponding to the desired filter coefficient; means for determining the region including the coefficient address; means for selecting a stored coefficient value from the memory according to the determined region; means for generating a difference value indicating a difference between the elected coefficient value and an adjacent coefficient value stored in the memory and defining another boundary of the determined region; means for generating a fractional value indicating a distance between the coefficient address and a coefficient address corresponding to the selected coefficient value; and means for computing the desired filter coefficient as a function of the selected coefficient value, the difference value and the fractional value.
Claim 14
Dependent Claim
45 words
The circuit of claim 11, wherein the means for generating the difference value includes: a difference memory containing difference values corresponding to each coefficient value in the memory; and means for selecting the difference value from the difference memory corresponding to the selected coefficient value.
Claim 15
Dependent Claim
86 words
The circuit of claim 12, wherein the means for selecting a coefficient value from the memory comprises: means for mapping a number of the most significant bits of the coefficient address to provide a reduced coefficient address and a shift control output; means for shifting a number of the least significant bits of the coefficient address to provide a shifted output; and means for accessing the memory using the reduced coefficient address and most significant bits of the shifted output to obtain the selected coefficient value.
Claim 16
Dependent Claim
28 words
The circuit of claim 13, wherein the means for selecting the difference value includes means for accessing the difference memory using most significant bits of the shifted output.
Claim 17
Dependent Claim
17 words
The circuit of claim 13, wherein the fractional value is least significant bits of the shifted output.
Claim 18
Dependent Claim
40 words
The circuit of claim 11, wherein the means for generating the difference value includes: means for selecting the adjacent coefficient value from the memory; and means for computing a difference between the adjacent coefficient value and the selected coefficient value.
Claim 19
Dependent Claim
86 words
The circuit of claim 16, wherein the means for selecting a coefficient value from the memory comprises: means for mapping a number of the most significant bits of the coefficient address to provide a reduced coefficient address and a shift control output; means for shifting a number of the least significant bits of the coefficient address to provide a shifted output; and means for accessing the memory using the reduced coefficient address and most significant bits of the shifted output to obtain the selected coefficient value.
Claim 20
Dependent Claim
17 words
The circuit of claim 17, wherein the fractional value is least significant bits of the shifted output.
Claim 21
Dependent Claim
86 words
The circuit of claim 11, wherein the means for selecting a coefficient value from the memory comprises: means for mapping a number of the most significant bits of the coefficient address to provide a reduced coefficient address and a shift control output; means for shifting a number of the least significant bits of the coefficient address to provide a shifted output; and means for accessing the memory using the reduced coefficient address and most significant bits of the shifted output to obtain the selected coefficient value.
Claim 22
Dependent Claim
325 words
A circuit for generating a desired filter coefficient of a digital filter, wherein each filter coefficient has a corresponding coefficient address in an address space defined by a number of taps of the digital filter, wherein the address space is divided into a plurality of regions, wherein each region includes a plurality of addresses in the address space, and wherein at least one region has a number of addresses different from other regions, the circuit comprising: a mapping circuit having an input for receiving a coefficient address in the address space for the desired filter coefficient and an output providing an indication of a region which includes the received coefficient address; a memory circuit including a memory in which a plurality of coefficient values, less than the number of taps of the digital filter, are stored, and wherein each pair of adjacent coefficient values stored in the memory define boundaries of one of the regions in the address space such that at least one region has a number of addresses different from other regions, and wherein the memory circuit has an input connected to receive the output of the mapping circuit and a first output providing from the memory a first coefficient value defining one boundary of the region indicated by the output of the mapping circuit a second output providing a difference value indicating a difference between the first coefficient value and a second adjacent coefficient value in the memory defining another boundary of the region and a third output providing a fractional value indicating a distance between the received coefficient address and a coefficient address corresponding to the first coefficient value; and an arithmetic unit having inputs connected to the first, second and third outputs of the mapping circuit to receive the coefficient value, the difference value and the fractional value and an output providing the desired filter coefficient as a function of the coefficient value, the difference value and the fractional value.
Claim 23
Dependent Claim
325 words
A circuit for generating a desired filter coefficient of a digital filter, wherein each filter coefficient has a corresponding coefficient address in an address space defined by a number of taps of the digital filter, wherein the address space is divided into a plurality of regions, wherein each region includes a plurality of addresses in the address space, and wherein at least one region has a number of addresses different from other regions, the circuit comprising: a mapping circuit having an input for receiving a coefficient address in the address space for the desired filter coefficient and an output providing an indication of a region which includes the received coefficient address; a memory circuit including a memory in which a plurality of coefficient values, less than the number of taps of the digital filter, are stored, and wherein each pair of adjacent coefficient values stored in the memory define boundaries of one of the regions in the address space such that at least one region has a number of addresses different from other regions, and wherein the memory circuit has an input connected to receive the output of the mapping circuit and a first output providing from the memory a first coefficient value defining one boundary of the region indicated by the output of the mapping circuit a second output providing a difference value indicating a difference between the first coefficient value and a second adjacent coefficient value in the memory defining another boundary of the region and a third output providing a fractional value indicating a distance between the received coefficient address and a coefficient address corresponding to the first coefficient value; and an arithmetic unit having inputs connected to the first, second and third outputs of the mapping circuit to receive the coefficient value, the difference value and the fractional value and an output providing the desired filter coefficient as a function of the coefficient value, the difference value and the fractional value.
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) | 2000-09-08 | 2001-03-10 | 2001-09-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-09-08 | 2005-03-10 | 2005-09-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-09-08 | 2009-03-10 | 2009-09-09 | $7700.00 | Window Closed / Lapsed |