FAST ALGORITHMS FOR EXPANDING SIGNALS INTO THE FOURIER SPECTRUM: NEW APPROACHES TO IMPROVING COMPUTATIONAL EFFICIENCY

Abstract:

The Fourier Transform is often the first tool used for the decomposition of a signal into a set of frequencies to measure the frequency content of the signal. Standard algorithms, such as the Fast Fourier Transform (FFT), have made improvements in computational efficiency. The need for real-time processing of large data means that we need even more efficient algorithms. The authors present new processes to address efficiency to expand signals to the Fourier spectrum. The authors introduce new mathematical models and algorithms that are faster, more accurate, and superior to traditional models and algorithms.