News for hackers. Stuff that matters.

A comment on Fast inverse chirp z-transform found. Parent comment

Re:Fast inverse chirp z-transform found by sroussey on Saturday October 12, 2019 @02:39AM (#21231081)
It should be a O(n log n) rather than O(n^2), so the speed increase for large n, which can be common n signal processing, is real.

If you think of FFT/IFFT only working for special cases, then works in the general sense.

[ Parent | on HN ]
Re:Fast inverse chirp z-transform found by novaRom on Saturday October 12, 2019 @04:56AM (#21231601)
FFT and iverse are of log complexity
[ Parent | on HN ]