🌐EnglishEnglishBahasa IndonesiaDeutschEspañolFrançaisItalianoNederlandsPolskiPortuguêsSvenskaTiếng ViệtTürkçeРусскийالعربيةفارسیहिन्दी한국어中文日本語EntityQ623950· pop 30· linked from 826 articlesfast Fourier transformAlso known as FFT, fast Fourier transformation𝑂(𝑁 log 𝑁) divide‐and‐conquer algorithm to calculate the discrete Fourier transformsAvailable in 30 languagesEspañolFrançaisDeutsch中文日本語РусскийPortuguêsItalianoالعربيةहिन्दीConnectionsSpringer Science+Business MediaEntityroot of unityEntityCategoriesDigital signal processingDiscrete transformsFast Fourier transforms