COMPARATIVE ANALYSIS OF COMPLEXITY OF FAST DIGITAL TRANSFORM REALIZATIONS ON RISC-PROCESSORS
ITMO University, Advanced Computing Laboratory; Junior Scientist
K. V. Yurkov
St. Petersburg National Research University of Information Technologies, Mechanics and Optics, Department of Information Systems;
E. P. Ovsyannikov
St. Petersburg State University of Aerospace Instrumentation, Department of Information Systems; Cand. Techn. Sci.
Abstract. FFT algorithms arranged on a RISC-platform are considered. It is shown that radix-2 FFT algorithm optimized for speed has the lowest complexity measured in processor cycles.
Keywords: FFT, RISC, complexity