1
0
mirror of https://github.com/microsoft/DirectXMath synced 2024-11-23 21:10:06 +00:00
3 FFT
Chuck Walbourn edited this page 2022-04-26 18:49:21 -07:00
This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

Fast Fourier Transform with an arbitrary number of samples.

void FFT(XMVECTOR* pReal, XMVECTOR* pImaginary,
        const XMVECTOR* pUnityTable,
        const size_t uLength, const size_t uCount=1);

Parameters

pReal

[in, out] Real components of the FFT. Must have as least (uLength × uCount) ÷ 4 elements.

pImaginary

[in, out] Imaginary components of the FFT. Must have at least (uLength × uCount) ÷ 4 elements.

pUnityTable

[in] Unity table the FFT should use. Must have at least uLength × uCount XVECTORs. See FFTInitializeUnityTable for more information.

uLength

[in] FFT length in samples. uLength must be a power of two and must be greater than 16.

uCount

[in] Number of FFT iterations.

Remarks

For FFTs with a number of samples less than or equal to 16 use FFT16, FFT8 or FFT4.

All buffer parameters must be 16-byte aligned. Audio data must be 32-bit float mono.

This performs a split-radix FFT, radix 4 and 2.