trusted
69
edits
Fast Fourier transform: Difference between revisions
Jump to navigation
Jump to search
m
→Simple recursive implementation
| Line 53: | Line 53: | ||
Inverse FFT can be defined for testing: | Inverse FFT can be defined for testing: | ||
<source lang=apl> | <source lang=apl> | ||
ifft←{(≢⍵)÷⍨+fft | ifft←{(≢⍵)÷⍨+fft+⍵} | ||
test←{⌈/(10○⊢)(⍵-ifft fft ⍵)} | test←{⌈/(10○⊢)(⍵-ifft fft ⍵)} | ||
test 1 1 1 1 0 0 0 0 | test 1 1 1 1 0 0 0 0 | ||