classPiiFft
#include <PiiFft.h>
A class for performing forward and inverse FFT for 1D and 2D signals.
Description
The calculation is optimized by splitting the input into pieces for which an optimized radix-N implementation exists. The class has implementations for radix 2, 3, 4, 5, 8, and 10.
Constructors and destructor
|
( )
|
|
|
( )
|
Public member functions
|
template<class S>
PiiMatrix<
std::complex< T > >
|
Perform a forward Fourier transform. |
|
template<class S>
PiiMatrix<
std::complex< T > >
|
Perform an inverse Fourier transform. |
|
template<class T>
PiiMatrix< T >
|
Calculate the correlation of two signals using the Fourier transform. |
Function details
-
PiiFft
() -
~PiiFft
() -
Perform a forward Fourier transform.
-
template<class S>
PiiMatrix< std::complex< T > > inverseFft
Perform an inverse Fourier transform.
-
Calculate the correlation of two signals using the Fourier transform.
The fast correlation is defined as
where F stands for the Fourier transform, and * marks complex conjugation. The input matrices must be equal in size.
Exceptions
- PiiMathException&
-
if input matrices are different in size
Add a note
Not a single note added yet. Be the first, add yours.