Results 221 to 230 of about 28,257 (266)
Some of the next articles are maybe not open access.
Flicker power algorithm based on Fast Fourier Transform (FFT) demodulation
2013 IEEE 3rd International Conference on System Engineering and Technology, 2013Voltage 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 +1 more
openaire +1 more source
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
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
System parameter identification in transport models using the fast Fourier transform (FFT)
Computers and Biomedical Research, 1981Abstract 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 +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), 2002Based 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
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
Klasifikasi Suara Pria Menggunakan Metode Fast Fourier Transform (FFT)
Jurnal Nasional Teknologi Informasi dan Aplikasnya, 2023Agus Muliantara +1 more
openaire +1 more source
Microbial volatile organic compounds in intra-kingdom and inter-kingdom interactions
Nature Reviews Microbiology, 2021Laure Weisskopf +2 more
exaly