Efficient software implementation of the nearly optimal sparse fast Fourier Transform for the noisy case

In this paper we present an optimized software implementation (sFFT-4.0) of the recently developed Nearly Optimal Sparse Fast Fourier Transform (sFFT) algorithm for the noisy case -- First, we developed a modified version of the Nearly Optimal sFFT algorithm for the noisy case, this modified algorithm solves the accuracy issues of the original version by modifying the flat window and the procedures; and second, we implemented the modified algorithm on a multicore platform composed of eight cores -- The experimental results on the cluster indicate that the developed implementation is faster than direct calculation using FFTW library under certain conditions of sparseness and signal size, and it improves the execution times of previous implementations like sFFT-2.0 -- To the best knowledge of the authors, the developed implementation is the first one of the Nearly Optimal sFFT algorithm for the noisy case

• Autores: López-Parrado, Alexander; Velasco Medina, Jaime
• Fecha de publicación: 2015
• Institución: Universidad EAFIT
• Repositorio: Repositorio EAFIT
• Idioma: eng
• OAI Identifier: oai:repository.eafit.edu.co:10784/7876
• Acceso en línea: http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/2884; http://hdl.handle.net/10784/7876
• Palabra clave: TRANSFORMACIONES DE FOURIER; PROGRAMACIÓN FUNCIONAL (COMPUTADORES); ARQUITECTURA DE COMPUTADORES; ANÁLISIS CLUSTER; Fourier transformations; Functional programming (Computer science); Computer architecture; Cluster analysis
• License: Copyright (c) 2015 Ingeniería y Ciencia - ing.cienc.