de.sciss.transform4s.fft
Type members
Classlikes
Computes 1D Discrete Fourier Transform (DFT) of complex and real, double
precision data. The size of the data can be an arbitrary number. This is a
parallel implementation of split-radix and mixed-radix algorithms optimized
for SMP systems.
This code is derived from General Purpose FFT Package written by Takuya Ooura
(http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html) and from JFFTPack written
by Baoshe Zhang (http://jfftpack.sourceforge.net/)
Computes 1D Discrete Fourier Transform (DFT) of complex and real, double
precision data. The size of the data can be an arbitrary number. This is a
parallel implementation of split-radix and mixed-radix algorithms optimized
for SMP systems.
This code is derived from General Purpose FFT Package written by Takuya Ooura
(http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html) and from JFFTPack written
by Baoshe Zhang (http://jfftpack.sourceforge.net/)
- Authors
Piotr Wendykier ([email protected])
- Companion
- class
Computes 2D Discrete Fourier Transform (DFT) of complex and real, double
precision data. The sizes of both dimensions can be arbitrary numbers. This
is a parallel implementation of split-radix and mixed-radix algorithms
optimized for SMP systems.
Part of the code is derived from General Purpose FFT Package written by Takuya Ooura
(http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html)
Computes 2D Discrete Fourier Transform (DFT) of complex and real, double
precision data. The sizes of both dimensions can be arbitrary numbers. This
is a parallel implementation of split-radix and mixed-radix algorithms
optimized for SMP systems.
Part of the code is derived from General Purpose FFT Package written by Takuya Ooura
(http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html)
- Authors
Piotr Wendykier ([email protected])
- Companion
- class