Rosetta Code

Fast Fourier transform: Difference between revisions

Page Discussion

Fast Fourier transform (view source)

Revision as of 17:37, 21 March 2011

36 bytes removed ,  13 years ago
m
Simplified
(→‎{{header|C++}}: Added C++ implementation)
m (Simplified)
Line 35:
for K in 0..N/2 - 1 loop
declare
AT : constant Complex := EvenOdd (EvenOdd'First + K) / F ** K;
B : constant Complex := Odd (Odd'First + K);
begin
EvenOdd (EvenOdd'First + K) := AEven (Even'First + B /K) F- ** KT;
Odd Even (OddEven'First + K) := AEven -(Even'First B+ /K) F+ ** KT;
end;
end loop;
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/171432"