Results 231 to 240 of about 274,335 (270)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021
The fast Fourier Transform (FFT), a reduced-complexity formulation of the Discrete Fourier Transform (DFT), is an important tool in many areas of science and engineering. FFTW is a well-known package that follows this approach and is currently one of the fastest available implementations of the FFT.
Sultan Durrani +4 more
openaire +1 more source
The fast Fourier Transform (FFT), a reduced-complexity formulation of the Discrete Fourier Transform (DFT), is an important tool in many areas of science and engineering. FFTW is a well-known package that follows this approach and is currently one of the fastest available implementations of the FFT.
Sultan Durrani +4 more
openaire +1 more source
IMTC/98 Conference Proceedings. IEEE Instrumentation and Measurement Technology Conference. Where Instrumentation is Going (Cat. No.98CH36222), 1998
An intelligent FFT analyzer capable of adapting its operating parameters on the basis of the signal spectrum was set up and characterized. The realized instrument is based on a parameter optimization procedure which provides the instrument with auto-configuration capability.
G. BETTA +3 more
openaire +3 more sources
An intelligent FFT analyzer capable of adapting its operating parameters on the basis of the signal spectrum was set up and characterized. The realized instrument is based on a parameter optimization procedure which provides the instrument with auto-configuration capability.
G. BETTA +3 more
openaire +3 more sources
SIAM Journal on Scientific and Statistical Computing, 1987
Es wird die Implementierung der schnellen Fouriertransformation auf Mehrprozessorrechnern einerseits auf rein experimenteller Basis und dann auf Grund von quantitativen Modellen zur Erklärung der erhaltenen Ergebnisse studiert, wobei die Studien auf einem HEP-Computer durchgeführt worden sind.
Briggs, William L. +3 more
openaire +1 more source
Es wird die Implementierung der schnellen Fouriertransformation auf Mehrprozessorrechnern einerseits auf rein experimenteller Basis und dann auf Grund von quantitativen Modellen zur Erklärung der erhaltenen Ergebnisse studiert, wobei die Studien auf einem HEP-Computer durchgeführt worden sind.
Briggs, William L. +3 more
openaire +1 more source
FFT and sparse FFT techniques and applications
2017 Fourteenth International Conference on Wireless and Optical Communications Networks (WOCN), 2017Currently, the FFT is used in different areas, starting from identification of frequency on mechanical vibration to image enhancement. Real-time computation by interpret the acquired data can be easily possible by Fast Fourier Transform (FFT). The best with an efficient algorithm is FFT so it is the foundation for analyzing, monitoring, and controlling
Badri Narayan Mohapatra +1 more
openaire +1 more source
Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems, 2011
Caches are known to consume a large part of total microprocessor power. Traditionally, voltage scaling has been used to reduce both dynamic and leakage power in caches. However, aggressive voltage reduction causes process-variation-induced failures in cache SRAM arrays, which compromise cache reliability.
Abbas BanaiyanMofrad +2 more
openaire +1 more source
Caches are known to consume a large part of total microprocessor power. Traditionally, voltage scaling has been used to reduce both dynamic and leakage power in caches. However, aggressive voltage reduction causes process-variation-induced failures in cache SRAM arrays, which compromise cache reliability.
Abbas BanaiyanMofrad +2 more
openaire +1 more source
Introducing ToPe‐FFT: An OpenCL‐based FFT library targeting GPUs
Concurrency and Computation: Practice and Experience, 2017SummaryIn this paper, we present our implementation of the fast Fourier transforms on graphic processing unit (GPU) using OpenCL. This implementation of the FFT (ToPe‐FFT) is based on the Cooley‐Tukey set of algorithms with support for 1D and higher dimensional transforms using different radices. Factorization for mix‐radices enables our code to target
Jan, Bilal +5 more
openaire +1 more source