Results 241 to 250 of about 2,482,737 (291)
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
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
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 +2 more sources
FAST: a compact general crystallographic fast Fourier transform (FFT)
Journal of Applied Crystallography, 1996A space-group-general radix-2 crystallographic fast Fourier transform (FFT) has been written in only 130 lines of executable Fortran code. Computational times compare favorably with other FFT programs that require 1000 or more lines of code excluding peak-interpolation routines. The complete program and description of control parameters are given.
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
Pipelined Fast Fourier Transform (FFT) Processor Power Optimization
2019 IEEE 7th Conference on Systems, Process and Control (ICSPC), 2019This paper presents the pipelined Fast Fourier Transform (FFT) processor power optimization. Pipelined FFT processor comprises of several sub-modules such as data buffer, shifter, and rotator (butterfly) which introduced power consumption to the circuit when in a hierarchical design.
Siti Lailatul Mohd Hassan +4 more
openaire +1 more source
A uniform model for parallel fast Fourier transform (FFT) and fast discrete cosine transform (FDCT)
[1991] Proceedings. Data Compression Conference, 2002Extended summary form only given. The techniques for parallel processing of FFT are applied to design a parallel processing model for FDCT. Each transform is translated to a sequence of elementary operations, an equation with regularity. From the similarity of both equations, a uniform representation for FFT and FDCT is derived and a common parallel ...
W.-K. Chou, D.Y.Y. Yun
openaire +1 more source
About this issue [special issue on the Fast Fourier Transform (FFT)]
IEEE Transactions on Audio and Electroacoustics, 1967This special issue is an outgrowth of standardization activities in audio and electroacoustics. In 1960, Subcommittee 30.4 on Methods of Measurement of Noise of the IRE Audio and Electroacoustics Committee (Technical Committee 30) became concerned with the characterization and measurement of quantities having a short duration.
openaire +1 more source