Results 11 to 20 of about 14,248 (263)
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 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
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
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
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
矿业科学学报, 2022 Rock heterogeneity (such as mineral inclusions, micro-cracks, micro-voids and other microstructures) significantly affects its nonlinear mechanical behavior and failure process.
Li Mingyao +5 more
doaj +1 more source
Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations [PDF]
Quantum, 2021 In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as low-entanglement states of
Juan José García-Ripoll
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
Generalized Orthogonal Discrete W Transform and Its Fast Algorithm
Discrete Dynamics in Nature and Society, 2021 Based on the generalized discrete Fourier transform, the generalized orthogonal discrete W transform and its fast algorithm are proposed and derived in this paper. The orthogonal discrete W transform proposed by Zhongde Wang has only four types. However,
Jichao Sun, Zhengping Zhang
doaj +1 more source