Results 211 to 220 of about 36,374 (262)
Some of the next articles are maybe not open access.
The extended function fast Fourier transform (EF-FFT)
IEEE Transactions on Instrumentation and Measurement, 1989The periodicity assumption implicit in fast Fourier transform (FFT) techniques can be utilized through time-domain prealiasing to obtain the spectral components of infinite-duration time-domain reflectometry signals when they can be modeled, outside the observation window, with step and/or exponential functions.
G.D. Cormack, J.O. Binder
openaire +1 more source
Multiplierless lifting based FFT via fast Hartley transform
, 2013 The multiplierless fast Fourier transform (FFT) with dyadic-valued (rational) coefficients is important for many signal processing tools. The proposed lifting based FFT (L-FFT) based on fast Hartley trans-form (FHT) has a simpler structure than existing ...
Taizo Suzuki +2 more
exaly +2 more sources
Fast Fourier Transform (FFT) on GPUs
2014The Fast Fourier Transform (FFT) is pre-dominantly used in the signal processing community to perform time-frequency domain transforms. This chapter describes tradeoffs when mapping the FFT to a GPUs. It presents different implementations of the algorithm for computing the FFT. The chapter includes a design strategy for mapping the FFT computation to a
Yash Ukidave +2 more
openaire +1 more source
Approximate Designs for Fast Fourier Transform (FFT) With Application to Speech Recognition
IEEE Transactions on Circuits and Systems I: Regular Papers, 2019This paper presents different approximate designs for computing the FFT. The tradeoff between accuracy and performance is achieved by adjusting the word length in each computational stage. Two algorithms for word length modification under a specific error margin are proposed.
Weiqiang Liu 0001 +5 more
openaire +1 more source
Performance Analysis of FFT(Fast Fourier Transform) with Respect to Different Multipliers
2024 4th International Conference on Artificial Intelligence and Signal Processing (AISP)Pratikhya Raut
exaly +2 more sources
The Fast Fourier Transform (FFT)
1985The Fast Fourier Transform (FFT) is one of the most frequently used mathematical tools for digital signal processing. Techniques that use a combination of digital and analogue approaches have been increasing in numbers. This chapter is for establishing the basis of this combined approach in dealing with computer tomography, computer holography and ...
openaire +1 more source
The Fast Fourier Transform (FFT)
1992Consider two polynomials $$ \begin{array}{*{20}{c}} {f\left( x \right) = {a_{0}} + {a_{1}}{x^{2}} + \ldots + {a_{n}}{x^{n}}} \\ {g\left( x \right) = {b_{0}} + {b_{1}}{x^{2}} + \ldots + {b_{m}}{x^{m}}.} \\ \end{array} $$
openaire +1 more source
Superscalar power efficient Fast Fourier Transform FFT architecture
2009 2nd International Conference on Computer, Control and Communication, 2009We develop Superscalar Architecture to compute fixed point FFT (Fast Fourier Transform). Some high-speed and time sensitive real time applications demand far better and efficient implementation of FFT and call for improved novel Architectures. This account for bringing in place an embedded custom Hardware for instance FPGA that helps us rally things in
Muhammad Ahsan +2 more
openaire +1 more source
Implementation of a fast Fourier transform (FFT) for image processing applications
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1974Different fast Fourier transform (FFT) algorithms for hardware implementation have been considered. We propose an implementation whereby two radix-N1/2passes are carried out in parallel and in which each N1/2-point transform is carried out via a serial input parallel output transform circuit.
H. Buijs +3 more
openaire +1 more source
A fast Fourier transform (FFT) based sonar signal processor
ICASSP '76. IEEE International Conference on Acoustics, Speech, and Signal Processing, 1978The design for a convolution processor is presented, which employs a single highly parallel implementation of the fast Fourier transform (FFT) algorithm. This processor is eminently suited for real-time matched filtering of coded signals encountered in sonar systems. Computer simulations have shown that this processor, which uses fixed point arithmetic
openaire +1 more source