New Algorithms for Computing a Single Component of the Discrete Fourier Transform
Discrete Mathematics
2018-01-24 v1 Data Structures and Algorithms
Signal Processing
Methodology
Abstract
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm.
Cite
@article{arxiv.1503.02577,
title = {New Algorithms for Computing a Single Component of the Discrete Fourier Transform},
author = {G. Jerônimo da Silva and R. M. Campello de Souza and H. M. de Oliveira},
journal= {arXiv preprint arXiv:1503.02577},
year = {2018}
}
Comments
4 pages, 3 figures, 1 table. In: 10th International Symposium on Communication Theory and Applications, Ambleside, UK