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 algorit...

Full description

Autores:
López-Parrado, Alexander
Velasco Medina, Jaime
Tipo de recurso:
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
Rights
License
Copyright (c) 2015 Ingeniería y Ciencia - ing.cienc.