A comprehensive suite of Fast Fourier transform (FFTs) in single-, double-, single-complex and double-complex data types.
The Lindsey–Fox algorithm uses the FFT (fast Fourier transform) to very efficiently conduct a grid search in the complex plane to find accurate approximations to the N roots (zeros) of an Nth-degree polynomial.
Almost twenty-four years later, Don Pearson and producer Dan Healy solved this problem by employing a B&K 2032 Fast Fourier transform (FFT) digital spectrum analyzer to measure the delay in time between the different microphones, using the track of bassist Phil Lesh as the time centerpiece.
Xilinx's IP cores include IP for simple functions (BCD encoders, counters, etc.), for domain specific cores (digital signal processing, FFT and FIR cores) to complex systems (multi-gigabit networking cores, the MicroBlaze soft microprocessor and the compact Picoblaze microcontroller).
Fourier series | Fourier transform | Fast Times at Ridgemont High | The Fast and the Furious (2001 film) | The Fast and the Furious | fast food | The Fast and the Furious: Tokyo Drift | The Fast Show | Laplace transform | Fast Fourier transform | Charles Fourier | Fourier analysis | Joseph Fourier | fast | Extract, transform, load | 2 Fast 2 Furious | The Fast and the Furious (film series) | Fast Food Nation | Fast food | Fast and Furry-ous | The Fast and the Furious (2006 video game) | Joseph Fourier University | Howard Fast | Fourier | Fast-moving consumer goods | Fast Five | Deloitte Fast 500 | Larry Fast | Hilbert transform | Fourier transform infrared spectroscopy |
A more efficient multiplication method, the Schönhage–Strassen algorithm based on the Fast Fourier transform, requires O(p log p log log p) time to square a p-bit number, reducing the complexity to O(p2 log p log log p) or Õ(p2).
The Numerical Recipes books cover a range of topics that include both classical numerical analysis (interpolation, integration, linear algebra, differential equations, and so on), signal processing (Fourier methods, filtering), statistical treatment of data, and a few topics in machine learning (hidden Markov models, support vector machines).
Single-carrier frequency-domain-equalization (SC-FDE), i.e. single-carrier modulation combined with guard intervals and fft based frequency domain equalization, or its multi-user version Single-carrier FDMA (SC-FDMA).
An architecture designed for use in signal processing may have a number of special-purpose instructions to facilitate certain complicated operations such as fast Fourier transform (FFT) computation or certain calculations that recur in tomographic contexts.
In 1971 Strassen published another paper together with Arnold Schönhage on asymptotically-fast integer multiplication based on the fast Fourier transform; see the Schönhage–Strassen algorithm.