This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: N [16,1024] and the average execution time displayed in Figure 1. It had been claimed that the FFT is a N log 2 ( N ) algorithm, yet the execution times are all over the map. What gives? Q. Why is the FFT latency all over the map. . Figure 1: Matlab execution delays for FFTs of length N [16,1024]. FFT - 1 Digital Signal Processing Dr. Fred J. Taylor, Professor Response The execution delays of individual radix-2 ( N =2 n ), mixed radix (( N =3*2 n , 5*2 n , 15*2 n ), and prime lengths are reported below. What conclusions may be drawn? N =2 n N =3*2 n N =5*2 n N =15*2 n N (prime) FFT - 2...
View Full Document