Go to the source code of this file.
|
GLUSAPI GLUSboolean | glusFourierDFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Performs a direct fourier transform on a given vector with N elements. More...
|
|
GLUSAPI GLUSboolean | glusFourierInverseDFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Performs an inverse direct fourier transform on a given vector with N elements. More...
|
|
GLUSAPI GLUSboolean | glusFourierRecursiveFFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Performs a fast fourier transform on a given vector with N elements, using a recursive algorithm. More...
|
|
GLUSAPI GLUSboolean | glusFourierRecursiveInverseFFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Performs an inverse fast fourier transform on a given vector with N elements, using a recursive algorithm. More...
|
|
GLUSAPI GLUSboolean | glusFourierButterflyShuffleFFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Shuffles a vector with N elements, that it can be used for a FFT butterfly algorithm. More...
|
|
GLUSAPI GLUSboolean | glusFourierButterflyShuffleFFTi (GLUSint *result, const GLUSint *vector, const GLUSint n) |
| Shuffles a index vector with N elements, that the indices can be used for a FFT butterfly algorithm. More...
|
|
GLUSAPI GLUSboolean | glusFourierButterflyFFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Performs a fast fourier transform on a given vector with N elements, using a butterfly algorithm. More...
|
|
GLUSAPI GLUSboolean | glusFourierButterflyInverseFFTc (GLUScomplex *result, const GLUScomplex *vector, const GLUSint n) |
| Performs an inverse fast fourier transform on a given vector with N elements, using a butterfly algorithm. More...
|
|
Performs a fast fourier transform on a given vector with N elements, using a butterfly algorithm.
Shuffling of the elements is done in this function.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if transform succeeded.
Performs an inverse fast fourier transform on a given vector with N elements, using a butterfly algorithm.
Shuffling of the elements is done in this function.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if transform succeeded.
Shuffles a vector with N elements, that it can be used for a FFT butterfly algorithm.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if shuffle succeeded.
Shuffles a index vector with N elements, that the indices can be used for a FFT butterfly algorithm.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if shuffle succeeded.
Performs a direct fourier transform on a given vector with N elements.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if transform succeeded.
Performs an inverse direct fourier transform on a given vector with N elements.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if transform succeeded.
Performs a fast fourier transform on a given vector with N elements, using a recursive algorithm.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if transform succeeded.
Performs an inverse fast fourier transform on a given vector with N elements, using a recursive algorithm.
- Parameters
-
result | The transformed vector. |
vector | The source vector. |
n | The number of elements. |
- Returns
- GLUS_TRUE, if transform succeeded.