Results 141 to 150 of about 138,884 (189)

Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT)

Fuzzy Sets and Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kosheleva, Olga, Cabrera, Sergio D., Gibson, Glenn A., Koshelev, Misha   +3 more
openaire   +1 more source

Applying fast Fourier transform (FFT) to statistic quality control

2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010
This article presents a FFT method in statistic quality control. Most previous statistic quality control tools can not analysis the quality data in both time and frequency. In this paper, the FFT method is used to transforming our view of the quality signal from time-based to frequency-based, to provide a basis for current decision during production as
You-xiang Cui, Jian-xin You, Feng Luo
openaire   +1 more source

FAST: a compact general crystallographic fast Fourier transform (FFT)

Journal of Applied Crystallography, 1996
A 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

Vibration Analysis on Rotating Machines using Fast Fourier Transform (FFT)

ACMIT Proceedings, 2019
The history has record that heavy industries face major problems that causes by variant types of mechanical failures came from rotating machines. The Vibrations in rotating machine almost fond in everywhere, due to unbalances, misalignments and imperfect part, analytical approaches has shown that vibration monitoring has great capability in detecting ...
Rusman Rusyadi, Iip Muhlisin
openaire   +1 more source

Flicker power algorithm based on Fast Fourier Transform (FFT) demodulation

2013 IEEE 3rd International Conference on System Engineering and Technology, 2013
Voltage flicker measurement methods become significantly important nowadays with increasing uses of the sensitive loads. Flicker Power algorithm has been found to be acceptable techniques for determining the flicker source direction in power system since it construction follow the IEEE flickermeter standard.
Nur Fadhilah Jamaludin, Ahamad Farid Abidin   +1 more
openaire   +1 more source

The Fast Fourier Transform (FFT)

1985
The 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)

1992
Consider 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

A fast Fourier transform (FFT) based sonar signal processor

ICASSP '76. IEEE International Conference on Acoustics, Speech, and Signal Processing, 1978
The 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

System parameter identification in transport models using the fast Fourier transform (FFT)

Computers and Biomedical Research, 1981
Abstract The fast Fourier transform (FFT) was investigated for potential use in a new application: the system identification problem in physiological transport models. It was found to offer specific advantages when compared to another well-established transform technique, time segment transformation (TST), in which input stimuli are modeled as a time
C, Wall, H S, Borovetz, J J, Murphy, R L, Hardesty   +3 more
openaire   +2 more sources

CG-FFT for nonuniform inverse fast Fourier transforms (NU-IFFTs)

IEEE Antennas and Propagation Society International Symposium. 1998 Digest. Antennas: Gateways to the Global Network. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.98CH36194), 2002
Based on the CG-FFT method and the NUFFT (nonuniform FFT) algorithm, a new nonuniform inverse FFT (NU-IFFT) algorithm is developed for nonuniform data. With a comparable complexity of O(N log/sub 2/N), this algorithm is much more accurate than the previously reported results since it is optimal in the least squares sense.
null Xue Yuan Tang, null Qing Huo Liu
openaire   +1 more source