Results 11 to 20 of about 17,052 (308)
The WaveD Transform in R: Performs Fast Translation-Invariant Wavelet Deconvolution
Journal of Statistical Software, 2007 This paper provides an introduction to a software package called waved making available all code necessary for reproducing the figures in the recently published articles on the WaveD transform for wavelet deconvolution of noisy signals. The forward WaveD
Marc Raimondo, Michael Stewart
doaj +1 more source
Polar Formed Histogram of Fast Fourier Transform Feature for Time-series Classification Problems [PDF]
Journal of Electrical and Computer Engineering Innovations, 2022 Background and Objectives: Time series classification (TSC) means classifying the data over time and based on their behavior. TSC is one of the main machine learning tasks related to time series.
K. Kiaei, H. Omranpour
doaj +1 more source
Fast Computation of Singular Oscillatory Fourier Transforms
Abstract and Applied Analysis, 2014 We consider the problem of the numerical evaluation of singular oscillatory Fourier transforms ∫abx-aαb-xβf(x)eiωxdx, where α>-1 and β>-1. Based on substituting the original interval of integration by the paths of steepest descent, if f is analytic ...
Hongchao Kang, Xinping Shao
doaj +1 more source
The Future Fast Fourier Transform? [PDF]
SIAM Journal on Scientific Computing, 1998 The authors propose that an inexact discrete Fourier transform such as an approximate matrix-vector approach based on singular values or a variation of the fast-multipole-based algorithm of \textit{A. Dutt} and \textit{V. Rokhlin} [Appl. Comput. Harmon. Anal. 2, No.
Alan Edelman +2 more
openaire +1 more source
Fourier transforming a trapped Bose-Einstein condensate by waiting a quarter of the trap period: simulation and applications [PDF]
, 2006 We investigate the property of isotropic harmonic traps to Fourier transform a weakly interacting Bose–Einstein condensate (BEC) every quarter of a trap period.
Ohberg, Patrik; id_orcid +5 more
core +1 more source
A novel secondary code acquisition algorithm for the BDS‐3 B1C signal
IET Radar, Sonar & Navigation, 2021 The BDS‐3 recently started broadcasting a new civil B1C signal to provide open services for global users, which brings benefits to GNSS‐based applications.
Tongsheng Qiu +4 more
doaj +1 more source
Fast Partial Fourier Transform
CoRR, 2020 Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. Despite its pervasive use, all known FFT algorithms do not provide a fine-tuning option for the user to specify ...
Yong-chan Park, Jun-Gi Jang, U Kang
openaire +2 more sources
Estimation of Translation, Rotation, and Scaling between Noisy Images Using the Fourier–Mellin Transform [PDF]
, 2009 In this paper we focus on extended Euclidean registration of a set of noisy images. We provide an appropriate statistical model for this kind of registration problems, and a new criterion based on Fourier-type transforms is proposed to estimate the ...
Gamboa, Fabrice +2 more
core +1 more source
A Fast Mellin and Scale Transform
EURASIP Journal on Advances in Signal Processing, 2007 A fast algorithm for the discrete-scale (and β-Mellin) transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity.
Davide Rocchesso, Antonio De Sena
doaj +2 more sources
An Improved Antenna Array Pattern Synthesis Method Using Fast Fourier Transforms
International Journal of Antennas and Propagation, 2015 An improved antenna array pattern synthesis method using fast Fourier transform is proposed, which can be effectively applied to the synthesis of large planar arrays with periodic structure.
Xucun Wang, Yiguo Zhou, Yanfei Wang
doaj +1 more source