Anonymous user
Fast Fourier transform: Difference between revisions
→{{header|APL}}: shortening
(→{{header|APL}}: shortening) |
|||
Line 204:
<lang APL>
fft←{
1>k←2÷⍨N←⍴⍵:⍵
▲ (1|2⍟N)≠0:'Argument must be a power of 2 in length'
even←∇(N⍴0 1)/⍵
odd←∇(N⍴1 0)/⍵
T←even×*(0J¯2×(○1)×(¯1+⍳k)÷N)
(odd+T),odd-T
|