Results 31 to 40 of about 17,052 (308)
REVISED FAST FOURIER TRANSFORM
Radio Electronics, Computer Science, Control, 2014 The problem of realisation of the Discrete Fourier Transform in on-line is analysed because of non-efficient consuming a time for a new recalculation of spectrum samples if one discrete-time signal sample or even some small portion of samples in period are replaced by new sample or by new samples, respectively.
openaire +4 more sources
Accelerating the Nonuniform Fast Fourier Transform [PDF]
SIAM Review, 2004 Summary: The nonequispaced Fourier transform arises in a variety of application areas, from medical imaging to radio astronomy to the numerical solution of partial differential equations. In a typical problem, one is given an irregular sampling of \(N\) data in the frequency domain and one is interested in reconstructing the corresponding function in ...
Leslie Greengard, June-Yub Lee
openaire +2 more sources
, 2011 Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach.
A. Cruden +7 more
core +1 more source
Comparative structural vibration analysis of machinery and GFRP with Al7075
MATEC Web of Conferences, 2018 The current scenario of the industries is that the major losses in efficiency of a machine are due to vibration and friction. To reduce the detrimental effects of vibration we need to decrease the frequency and amplitude of vibration or completely ...
Vinoth Kumar K. +4 more
doaj +2 more sources
Algorithms, 2023 To enforce the conservation of mass principle, a pressure Poisson equation arises in the numerical solution of incompressible fluid flow using the pressure-based segregated algorithms such as projection methods.
Jiannong Fang
doaj +1 more source
An Ultra-Precise Fast Fourier Transform
SSRN Electronic Journal, 2022 The Fast Fourier Transform (FFT) is a cornerstone of digital signal processing, generating a computationally efficient estimate of the frequency content of a time series. Its limitations include: (1) information is only provided at discrete frequency steps, so further calculation, for example interpolation, may be required to obtain improved estimates ...
openaire +4 more sources
Fast Fourier transforms for the rook monoid [PDF]
Transactions of the American Mathematical Society, 2009 We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups.
Malandro, Martin, Rockmore, Dan
openaire +2 more sources
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
A computational insight into cardiac beat-to-beat intervals variability: from normal to pathological
Studia Universitatis Babeș-Bolyai. Biologia, 2018 Over the past 100 years, electrocardiography (ECG) has provided essential information for diagnosing patients with cardiovascular diseases. Despites the large clinical usefulness of classic paper printed 12-lead ECG, along with the accelerated ...
Ștefan-Claudiu Mirescu +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source