On 2020-03-19, Dario Sanfilippo wrote:
Thanks for your email, all good points. From the top of your head,
could you please point me to a reference for the measurement of
calculations needed in direct-form filters?
The best computational complexity in direct form convolution is
guaranteed to
Hi, Ethan.
Thanks for your email, all good points. From the top of your head, could
you please point me to a reference for the measurement of calculations
needed in direct-form filters?
Best,
Dario
On Thu, 19 Mar 2020 at 17:28, Ethan Duni wrote:
>
>
> On Thu, Mar 19, 2020 at 8:11 AM Dario
> If simply comparing two algorithms by the number of operations needed to
> compute a sample, would you include delays in filters as an operation? I'm
> just wondering as some papers about FFT only include real multiplications
> and additions as operations.
>
It depends whether you are
On Thu, Mar 19, 2020 at 8:11 AM Dario Sanfilippo
wrote:
>
> I believe that the time complexity of FFT is O(nlog(n)); would you perhaps
> have a list or reference to a paper that shows the time complexity of
> common DSP systems such as a 1-pole filter?
>
The complexity depends on the topology.
Hello, list.
I would like to compare the efficiency of some feature extraction
algorithms based on FFT with some original time-domain algorithms used to
measure the same perceptual characteristics.
I believe that the time complexity of FFT is O(nlog(n)); would you perhaps
have a list or
