New Algorithms for Computing a Single Component of the Discrete Fourier Transform

March 09, 2015 · The Ethereal · 🏛 arXiv.org

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors G. Jerônimo da Silva, R. M. Campello de Souza, H. M. de Oliveira arXiv ID 1503.02577 Category cs.DM: Discrete Mathematics Cross-listed cs.DS, eess.SP, stat.ME Citations 3 Venue arXiv.org Last Checked 6 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics