こうそくへんかん
高速フーリエ変換
1. Fast Fourier Transform; FFTMathematics
2. Fast Fourier transformA fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this article gives an overview of the available techniques and some of their general properties, while the specific algorithms are described in subsidiary articles linked below.
Read “Fast Fourier transform” on English Wikipedia
Read “高速フーリエ変換” on Japanese Wikipedia
Read “Fast Fourier transform” on DBpedia
Read “Fast Fourier transform” on English Wikipedia
Read “高速フーリエ変換” on Japanese Wikipedia
Read “Fast Fourier transform” on DBpedia
Discussions
Log in to talk about this word.