shz_fft
SHZ_INLINE void shz_fft(shz_complex_t* s, size_t size) SHZ_NOEXCEPT;Fast Fourier Transform.
Parameters
Section titled “Parameters”| Name | Type | Description |
|---|---|---|
s | shz_complex_t * | |
size | size_t |
Returns
Section titled “Returns”Nothing (void).
Details
Section titled “Details”Applies a fast fourier transform to convert the complex array of samples, s, of the given size, from the time to the frequency domain. The conversion is done in-place.
- The underlying implementation uses the Radix2 variant of the Cooley-Tukey FFT algorithm, using an XMTRX-accelerated 2 point butterfly DIF.
Warnings
Section titled “Warnings”sizemust be a power-of-two!smust be aligned to 8-byte boundaries!- This routine clobbers
XMTRX!
Availability
Section titled “Availability”- C++ equivalent:
shz::fft - Type-generic form: none
- Back-ends: SH4: shared C implementation · SW: portable C · SPU: shared C implementation
- Defined in:
sh4zam/shz_complex.h:255 - Module: Complex, section "Signal Processing"