Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
156 words
A method for building a digital filter with a long impulse response and low latency, built by operating a number of smaller component filters in parallel and combining their outputs by addition, with each component filter operating with a different delay such that the net operation of the ensemble of said component filters is the same as a single filter with a longer impulse response, and the latency of the ensemble is equal to the shortest latency of said component filters wherein one or more of said component filters is implemented as a time-domain finite impulse response filter, built with multiply and add operations, and the remainder of said component filters are implemented using a fast convolution method, such that time-domain filter(s) provides the lowest latency portion of the ensemble impulse, and fast convolution filter(s) provide longer filter components, wherein said fast convolution filters are built using the Discrete Fourier Transform or the Fast Fourier Transform.
Claim 2
Independent Claim
156 words
A method for building a digital filter with a long impulse response and low latency, built by operating a number of smaller component filters in parallel and combining their outputs by addition, with each component filter operating with a different delay such that the net operation of the ensemble of said component filters is the same as a single filter with a longer impulse response, and the latency of the ensemble is equal to the shortest latency of said component filters wherein one or more of said component filters is implemented as a time-domain finite impulse response filter, built with multiply and add operations, and the remainder of said component filters are implemented using a fast convolution method, such that time-domain filter(s) provides the lowest latency portion of the ensemble impulse, and fast convolution filter(s) provide longer filter components, wherein said fast convolution filters are built using the Discrete Fourier Transform or the Fast Fourier Transform.
Claim 3
Independent Claim
215 words
A method for building a digital filter with a long impulse response and low latency built by operating a number of smaller component filters in parallel and combining their outputs by addition, with each component filter operating with a different delay such that the net operation of the ensemble of said component filters is the same as a single filter with a longer impulse response, and the latency of the ensemble is equal to the shortest latency of said component filters wherein one or more of said component filters is implemented as a time-domain finite impulse response filter, built with multiply and add operations, and the remainder of said component filters are implemented using a fast convolution method, such that time-domain filter provides the lowest latency portion of the ensemble impulse response, and fast-convolution filter provide the longer filter components, wherein said fast-convolution filters are built using a Modified Discrete Fourier Transform method comprising the steps of: receiving an input vector x(k) of length N, where each element of x(k) is real; means for creating a complex vector x'(l) of length N/2 according to the following: ##EQU13## computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): ##EQU14## and a complementary Inverse Modified Discrete Fourier Transform method.
Claim 4
Independent Claim
215 words
A method for building a digital filter with a long impulse response and low latency built by operating a number of smaller component filters in parallel and combining their outputs by addition, with each component filter operating with a different delay such that the net operation of the ensemble of said component filters is the same as a single filter with a longer impulse response, and the latency of the ensemble is equal to the shortest latency of said component filters wherein one or more of said component filters is implemented as a time-domain finite impulse response filter, built with multiply and add operations, and the remainder of said component filters are implemented using a fast convolution method, such that time-domain filter provides the lowest latency portion of the ensemble impulse response, and fast-convolution filter provide the longer filter components, wherein said fast-convolution filters are built using a Modified Discrete Fourier Transform method comprising the steps of: receiving an input vector x(k) of length N, where each element of x(k) is real; means for creating a complex vector x'(l) of length N/2 according to the following: ##EQU13## computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): ##EQU14## and a complementary Inverse Modified Discrete Fourier Transform method.
Claim 5
Dependent Claim
180 words
A composite electrical filter comprising a plurality of filter modules arranged to receive in parallel an incoming input signal for filtering, an output from each of said filter modules being summed to produce a composite filtered output signal, each of said filter modules having an impulse response that is a selected portion of said impulse response of the composite filter wherein the number of said filter module is N, comprising filters F 1 , F 2 . . . F N and wherein filter modules F 1 is a filter with a very low latency implemented with time domain techniques while all other filter modules F i are implemented with fast convolution means and these fast convolution filters F i are composed of a sequence of filters, each with longer filter length than its predecessor and hence each with longer latency, but still preserving the property that d i+1 =d i +l i whereby it is ensured that said composite filter F output formed by summing together N component filter outputs has an impulse response without any "holes" in it.
Claim 6
Dependent Claim
180 words
A composite electrical filter comprising a plurality of filter modules arranged to receive in parallel an incoming input signal for filtering, an output from each of said filter modules being summed to produce a composite filtered output signal, each of said filter modules having an impulse response that is a selected portion of said impulse response of the composite filter wherein the number of said filter module is N, comprising filters F 1 , F 2 . . . F N and wherein filter modules F 1 is a filter with a very low latency implemented with time domain techniques while all other filter modules F i are implemented with fast convolution means and these fast convolution filters F i are composed of a sequence of filters, each with longer filter length than its predecessor and hence each with longer latency, but still preserving the property that d i+1 =d i +l i whereby it is ensured that said composite filter F output formed by summing together N component filter outputs has an impulse response without any "holes" in it.
Claim 7
Dependent Claim
109 words
A digital filter having an impulse response that includes a low latency and a long filter length, said digital filter comprising a plurality of component filters each having an impulse response including a latency and a filter length, each of said component filter having an input connected to an input of said digital filter, and an output connected to a summing means for combining, by addition, each of said outputs to form an output of said digital filter such that the impulse response of said digital filter is the sum of the component impulse responses and the low latency is equal to the shortest one of the component latencies.
Claim 8
Dependent Claim
109 words
A digital filter having an impulse response that includes a low latency and a long filter length, said digital filter comprising a plurality of component filters each having an impulse response including a latency and a filter length, each of said component filter having an input connected to an input of said digital filter, and an output connected to a summing means for combining, by addition, each of said outputs to form an output of said digital filter such that the impulse response of said digital filter is the sum of the component impulse responses and the low latency is equal to the shortest one of the component latencies.
Claim 9
Dependent Claim
44 words
The digital filter as claimed in claim 4, wherein at least a first one of said component filters is specifically configured to provide said low latency, and at least another one of said component filters is specifically configured to provide a long filter length.
Claim 10
Dependent Claim
39 words
The digital filter as claimed in claim 5 wherein, excepting said first component filter, a first non-zero impulse component of each remaining component filter occurs during or immediately following the impulse response of another one of said component filters.
Claim 11
Dependent Claim
36 words
The digital filter as claimed in claim 6 wherein at least one of said component filters comprises a fast convolution filter having a transform element, a filter element, and an inverse transform element connected in cascade.
Claim 12
Dependent Claim
35 words
The digital filter as claimed in claim 7 comprising a first fast convolution filter configured to provide said low latency and at least one other fast convolution filter configured to provide said long filter length.
Claim 13
Dependent Claim
73 words
The digital filter as claimed in claim 7 wherein at least one of said component filters is implemented as a time-domain finite impulse response filter including multiply and add operations and the remainder of said component filters, of which there is at least one, are each implemented using a fast convolution filter such that the time domain filter provides said low latency and said fast convolution filter substantially provide said long filter length.
Claim 14
Dependent Claim
69 words
The digital filter as claimed in claim 7 wherein at least one of said fast convolution filter comprises a modified convolution filter in which said filter element comprises a plurality of filter sub-elements arranged in parallel and each configured to receive a transformed signal output from said transform element, each of said filter sub-elements supplying a corresponding input of an adding element that outputs to said inverse transform element.
Claim 15
Dependent Claim
61 words
The digital filter as claimed in claim 10 wherein each of said filter sub-element comprises a delay unit that delays application of said transformed signal to a corresponding multiplication unit where said delayed transformed signal is multiplied by filter coefficients preselected to form at least a part of said impulse response, each of said multiplication units outputting to said adding element.
Claim 16
Dependent Claim
34 words
The digital filter as claimed in claim 11 wherein said delay units delay said transformed signal by an integer multiple of a predetermined delay period prior to applying same to the corresponding multiplication unit.
Claim 17
Dependent Claim
79 words
The digital filter as claimed in claim 12 wherein said filter element comprises N-1 (N being an integer and ≦2) of said delay units connected in cascade and each of said predetermined delay, a first one of said delay units being input with said transformed signal and N of said multiplication units, a first one of which being input with said transformed signal and the remainder being input with the output of a corresponding one of said delay units.
Claim 18
Dependent Claim
26 words
The digital filter as claimed in claim 10, comprising two or more of said component filters, each of which are formed as said modified convolution filter.
Claim 19
Dependent Claim
25 words
The digital filter as claimed in claim 10 wherein at least one of said component filters is a time-domain filter configured to provide low latency.
Claim 20
Dependent Claim
16 words
The digital filter as claimed in claim 15 wherein said time domain filter comprises zero latency.
Claim 21
Dependent Claim
28 words
The digital filter as claimed in claim 16 comprising said zero latency time domain filter, one or more modified convolution filters and one or more fast convolution filters.
Claim 22
Dependent Claim
19 words
The digital filter as claimed in claim 15 wherein said time domain filter is a finite impulse response filter.
Claim 23
Dependent Claim
24 words
The digital filter as claimed in claim 7 wherein said fast-convolution filter(s) perform one of a Discrete Fourier Transform or a Fast Fourier Transform.
Claim 24
Dependent Claim
80 words
The digital filter as claimed in claim 7 wherein the fast-convolution filters are built using a Modified Discrete Fourier Transform method comprising the steps of: receiving an input vector x(k) of length N, where each element of x(k) is real; creating a complex vector x'(l) of length N/2 according to the following: ##EQU15## computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): ##EQU16## and a complementary Inverse Modified Discrete Fourier Transform.
Claim 25
Dependent Claim
30 words
The digital filter as claimed in claim 4 wherein said low latency is sufficiently short so as to permit said digital filter to be used to process live audio signals.
Claim 26
Dependent Claim
128 words
A digital filter comprising a plurality of filter modules arranged in parallel and each configured to receive an input signal for filtering, an output of each of said filter modules being summed to produce a composite filtered output signal, each of said filter modules having a corresponding filter length and a corresponding impulse response that is a selected portion of a desired impulse response of said digital filter, wherein the length of each of said filter modules is different, and wherein at least the shortest length filter module is a time-domain low latency filter configured to process at least first portions of said desired impulse response and the longer length filter module is a fast-convolution longer latency filter configured to process subsequent portions of said desired impulse response.
Claim 27
Dependent Claim
128 words
A digital filter comprising a plurality of filter modules arranged in parallel and each configured to receive an input signal for filtering, an output of each of said filter modules being summed to produce a composite filtered output signal, each of said filter modules having a corresponding filter length and a corresponding impulse response that is a selected portion of a desired impulse response of said digital filter, wherein the length of each of said filter modules is different, and wherein at least the shortest length filter module is a time-domain low latency filter configured to process at least first portions of said desired impulse response and the longer length filter module is a fast-convolution longer latency filter configured to process subsequent portions of said desired impulse response.
Claim 28
Dependent Claim
115 words
The digital filter of claim 22, where the number of said filter modules is N comprising filters F 1 , F 2 . . . F N and wherein filter modules F 1 is a filter with a very low latency implemented with time domain techniques while all other filter modules F i (2≦i≦N) are implemented with fast convolution techniques, each of said filters Fi being of longer filter length (l) than its predecessor and hence each with longer latency (d), but preserving the property that d i+1 =d i +1 i , thereby ensuring that the composite filtered output formed by summing together the N component filter outputs forms a substantially continuous impulse response.
Claim 29
Dependent Claim
83 words
A Fourier transform processor adapted to transform strings of real numbers of use in digital filtering, said processor comprising: input means for receiving an input vector x(k) of length N, where each element of x(k) is real; vector means for creating a complex vector x'(l) of length N/2 according to the following: ##EQU17## transform means for computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): ##EQU18## and a complementary Inverse Modified Discrete Fourier Transform.
Claim 30
Dependent Claim
83 words
A Fourier transform processor adapted to transform strings of real numbers of use in digital filtering, said processor comprising: input means for receiving an input vector x(k) of length N, where each element of x(k) is real; vector means for creating a complex vector x'(l) of length N/2 according to the following: ##EQU17## transform means for computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): ##EQU18## and a complementary Inverse Modified Discrete Fourier Transform.
Claim 31
Dependent Claim
147 words
A digital filter with a long impulse response and low latency comprising a smaller number of component filters in parallel and adding means for combining the output of said component filters, with each component filter operating with a different delay such that the net operation of said component filters is the same as a single filter with a longer impulse response, and the latency of said component filters is equal to a shortest latency of the said component filters wherein one or more of said component filters comprise a time-domain finite impulse response filter and multipliers and adders, and the remainder of said component filters comprise a fast convolution means, such that time-domain filter provide the lowest latency portion of said component filters impulse response, and the fast-convolution means provide the longer filter components and said fast-convolution means comprise Discrete Fourier Transformer or the Fast Fourier Transformer.
Claim 32
Dependent Claim
147 words
A digital filter with a long impulse response and low latency comprising a smaller number of component filters in parallel and adding means for combining the output of said component filters, with each component filter operating with a different delay such that the net operation of said component filters is the same as a single filter with a longer impulse response, and the latency of said component filters is equal to a shortest latency of the said component filters wherein one or more of said component filters comprise a time-domain finite impulse response filter and multipliers and adders, and the remainder of said component filters comprise a fast convolution means, such that time-domain filter provide the lowest latency portion of said component filters impulse response, and the fast-convolution means provide the longer filter components and said fast-convolution means comprise Discrete Fourier Transformer or the Fast Fourier Transformer.
Claim 33
Dependent Claim
215 words
A digital filter with a long impulse response and low latency comprising a smaller number of component filters in parallel and adding means for combining the output of said component filters, with each component filter operating with a different delay such that the net operation of said component filters is the same as a single filter with a longer impulse response, and the latency of said component filters is equal to a shortest latency of the said component filters wherein one or more of said component filters comprise a time-domain finite impulse response filter and multipliers and adders, and the remainder of said component filters comprise a fast convolution means, such that time-domain filter provide the lowest latency portion of said component filters impulse response, and the fast-convolution means provide the longer filter components and said fast-convolution means comprise a Modified Discrete Fourier Transform processor comprising: means for receiving an input vector x(k) of length N, where each element of x(k) is real; means for creating a complex vector x'(l) of length N/2 according to the following: x'(l)= x(l)-jx( l+N/2) !e.sup.-xjl/N for 0≦l≦N/2; and means for computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): Z(p)=DFT.sub.(n/2) x'(l)!, and a complementary Inverse Modified Discrete Fourier Transform processor.
Claim 34
Dependent Claim
215 words
A digital filter with a long impulse response and low latency comprising a smaller number of component filters in parallel and adding means for combining the output of said component filters, with each component filter operating with a different delay such that the net operation of said component filters is the same as a single filter with a longer impulse response, and the latency of said component filters is equal to a shortest latency of the said component filters wherein one or more of said component filters comprise a time-domain finite impulse response filter and multipliers and adders, and the remainder of said component filters comprise a fast convolution means, such that time-domain filter provide the lowest latency portion of said component filters impulse response, and the fast-convolution means provide the longer filter components and said fast-convolution means comprise a Modified Discrete Fourier Transform processor comprising: means for receiving an input vector x(k) of length N, where each element of x(k) is real; means for creating a complex vector x'(l) of length N/2 according to the following: x'(l)= x(l)-jx( l+N/2) !e.sup.-xjl/N for 0≦l≦N/2; and means for computing an N/2 point Discrete Fourier Transform (DFT) of x'(l) to give the N/2 complex result vector Z(p): Z(p)=DFT.sub.(n/2) x'(l)!, and a complementary Inverse Modified Discrete Fourier Transform processor.