docs: explain forward and inverse normalization

This commit is contained in:
AC
2026-10-19 11:51:48 +08:00
parent 45b3ad4c08
commit d3a85a9e01
3 changed files with 30 additions and 0 deletions
+4
View File
@@ -147,6 +147,10 @@ kiss_fft_cfg KISS_FFT_API kiss_fft_alloc(int nfft,int inverse_fft,void * mem,siz
* for a forward FFT,
* fin should be f[0] , f[1] , ... ,f[nfft-1]
* fout will be F[0] , F[1] , ... ,F[nfft-1]
* Floating-point transforms are unnormalized in both directions: a forward
* transform followed by an inverse yields nfft times the original input.
* Divide the inverse output by nfft to recover the input. Fixed-point builds
* instead scale internally in both directions to prevent overflow.
* Note that each element is complex and can be accessed like
f[k].r and f[k].i
* */