Results 231 to 240 of about 2,482,737 (291)

Parasympathetic Tone Selectively Modulates Electrogram Fragmentation and Spectral Properties in Right Atrial Ganglionated Plexi. [PDF]

J Arrhythm
Giomi A, Bernardini A, Perini AP, Padeletti M, Zaccaria CS, Michelotti F, Signorini U, Marcucci R, Milli M.   +8 more
europepmc   +1 more source

A Fully Magnetic Resonance Imaging-Compatible, Nonelectrical System for Near-Real-Time Tremor Monitoring during Magnetic Resonance-Guided Focused Ultrasound.

Stereotact Funct Neurosurg
Lavalley A, Lorton O, Constanthin P, Fleury V, Momjian S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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
Jian-Xin You
exaly   +2 more sources

Superscalar power efficient Fast Fourier Transform FFT architecture

2009 2nd International Conference on Computer, Control and Communication, 2009
We 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, Ehtsham Elahi, Waqas Ahmad Farooqi   +2 more
exaly   +2 more sources

The Fast Fourier Transform (FFT)

Springer Series in Optical Sciences, 2008
exaly   +2 more sources

FAST FOURIER TRANSFORM (FFT)

2023
Source: Masters Abstracts International, Volume: 09-01, page: 3100.
openaire   +1 more source

Fast Fourier Transform (FFT) on GPUs

2014
The 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, Gunar Schirner, David Kaeli   +2 more
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

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

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.
Olga Kosheleva, Sergio D. Cabrera, Glenn A. Gibson, Misha Koshelev   +3 more
openaire   +2 more sources