Java中可靠而快速的FFT [英] Reliable and fast FFT in Java

问题描述

因为我不想自己做，所以我正在为java寻找一个很好的FFT实现。首先我在这里使用了这个 FFT普林斯顿，但它使用了对象和我的探查者告诉我，由于这个事实，它并不是很快。所以我再次搜索并找到了这个： FFT哥伦比亚哪个更快。也许你们其中一个人知道另一个FFT实现？我想拥有最好的，因为我的应用程序必须处理大量的声音数据，用户不喜欢等待...; - ）

<问候。

解决方案

FFTW是西方最快的傅里叶变换，并且有一些Java包装器：

http：// www。 fftw.org/download.html

希望有所帮助！

since I don't want to do it on my own, I am searching for a good FFT implementation for java. First I used this one here FFT Princeton but it uses objects and my profiler told me, that its not really fast due to this fact. So I googled again and found this one: FFT Columbia which is faster. Maybe one of you guys know another FFT implementation? I'd like to have the "best" one because my app has to process a huge amount of sound data, and users don't like waiting... ;-)

Regards.

解决方案

FFTW is the 'fastest fourier transform in the west', and has some Java wrappers:

http://www.fftw.org/download.html

Hope that helps!

这篇关于Java中可靠而快速的FFT的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！