21 papers · ranked by Valyu relevance
Pablo Soto-Quiros
This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT): the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block…
Travis D. Andrews, John J. Benedetto, Jeffrey J. Donatelli
Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time-frequency analysis is essential. The definition of the DFT requires associated uncertainty principle inequalities.…
Aleksandr Cariow
—Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of complexvalued data when each element of the sequence represents a single whole.…
Gilles Burel, Anthony Fiche, Roland Gautier, Yuh-Shyan Chen + 2 more
'Ilsun You' 'Shih-Lin Wu'] In the context of cognitive radio, smart cities and Internet-of-Things, the need for advanced radio spectrum monitoring becomes crucial. However, surveillance of a wide frequency band without using extremely expensive high sampling rate devices is a challenging task. The recent development of…
Sara Giarrusso, Paola Gori-Giorgi, Federica Agostini
We generalize the definitions of local scalar potentials named vkin and vN−1, which are relevant to properly describe phenomena such as molecular dissociation with density-functional theory, to the case in which the electronic wavefunction corresponds to a complex current-carrying state. In such a case, an extra term…
L. Portella, F. M. Bayer, R. J. Cintra
Matrix approximation methods have successfully produced efficient, low-complexity approximate transforms for the discrete cosine transforms and the discrete Fourier transforms. For the DFT case, literature archives approximations operating at small power-of-two blocklenghts, such as {8, 16, 32}, or at large…
Simon Dirckx, Daan Huybrechs, Robbe Ongenae
Contiguous submatrices of the Fourier matrix are known to be ill-conditioned. In a recent paper in SIAM Review A. Barnett has provided new bounds on the rate of ill-conditioning of the discrete Fourier submatrices [1]. In this paper we focus on the corresponding singular value decomposition. The singular vectors go by…
Christian Oswald, Franz Pernkopf
—The efficiently computed multiangle centered discrete fractional Fourier transform (MA-CDFRFT) [1] has proven as a useful tool for time-frequency analysis; however, its scope is limited to the centered discrete fractional Fourier transform (CDFRFT). Meanwhile, extensive research on the standard DFRFT has lead to a…
Jing Zhao, Yun-Zhang Li
The construction of bi-frames is a fundamental problem in frame theory. Due to their wide applications, the study of vector-valued frames and subspace frames has interested many mathematicians in recent years. In this paper, we introduce the weak Gabor bi-frame (WGBF) in vector-valued subspaces, characterize WGBFs on…
Authors not listed
We establish a low-dimensional vector embedding of density functional approximations (DFAs) from a low-rank decomposition of the GMTKN55 database. The optimal embedding of DFAs simultaneously provides a dual embedding for chemical tasks, revealing a strong correlation between different tasks and signifying the…
Hicham Tarif, Nadir Maaroufi
The main contribution of this paper is a constructive method for building separable multivariate vector-valued wavelet bases in the general framework of L 2 (R d , R m) for any d, m ≥ 1. While separable wavelet bases in L 2 (R d , R) are well-established and widely applied, the explicit construction of truly…
H. M. Moya-Cessa, Francisco Soto-Eguíbar
Based on the definition of the Fourier transform in terms of the number operator of the quantum harmonic oscillator and in the corresponding definition of the fractional Fourier transform, we have obtained the discrete fractional Fourier transform from the discrete Fourier transform in a completely analogous manner. To…
Jiening Zhu, Jung Hun Oh, Joseph O. Deasy, Allen Tannenbaum
In this paper, we present a network-based clustering method based on the vector-valued Wasserstein distance derived from optimal mass transport (OMT) theory. This distance allows for the natural integration of multi-layer representations of data in a given network from which one derives clusters via a hierarchical…
Franz Lampel, Hamdi Joudeh, Alex Alvarado, Frans M. J. Willems + 4 more
'H. Vincent Poor' 'Holger Boche' 'Rafael F. Schaefer' 'Onur Günlü'] In orthogonal time frequency space (OTFS) modulation, information-carrying symbols reside in the delay-Doppler (DD) domain. By operating in the DD domain, an appealing property for communication arises: time-frequency (TF) dispersive channels…
Xueyang Yao, Natalie Baddour, Yilun Shang
The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In the first part of this two-paper series, we proposed and evaluated the theory of the 2D Discrete Fourier Transform (DFT) in polar coordinates. The theory of…
Emil Wärnberg, Arvind Kumar
It is well established that midbrain dopaminergic neurons support reinforcement learning (RL) in the basal ganglia by transmitting a reward prediction error (RPE) to the striatum. In particular, different computational models and experiments have shown that a striatumwide RPE signal can support RL over a small discrete…
Richard Yang, Heather D. Orser, Kip A. Ludwig, Brandon S. Coventry
Digital implementations of discrete Fourier transforms (DFT) are a mainstay in feature assessment of recorded biopotentials, particularly in the quantification of biomarkers of neurological disease state for adaptive deep brain stimulation. Fast Fourier transform (FFT) algorithms and architectures present a substantial…
Qiuyan Miao, Qingxin Shu, Bin Wu, Xinglin Sun + 2 more
'Maysam Abbod'] Complex variational mode decomposition (CVMD) has been proposed to extend the original variational mode decomposition (VMD) algorithm to analyze complex-valued data. Conventionally, CVMD divides complex-valued data into positive and negative frequency components using bandpass filters, which leads to…
Yu-Chen Huang, Aymen Alian, Yu-Lun Lo, Kirk Shelley + 1 more
Phase is the most fundamental physical quantity when we study an oscillatory time series, and there are a lot of tools aiming to estimate phase. Most existing tools are developed based on the well-developed analytic function model. Unfortunately, this approach might not be suitable for several modern signals…
Xianpeng Wang, Wei Wang, Xin Li, Jing Liu + 1 more
In this paper, a real-valued covariance vector sparsity-inducing method for direction of arrival (DOA) estimation is proposed in monostatic multiple-input multiple-output (MIMO) radar. Exploiting the special configuration of monostatic MIMO radar, low-dimensional real-valued received data can be obtained by using the…
Emanuele Quattrocchi, Baptiste Py, Adeleke Maradesa, Quentin Meyer + 2 more
Electrochemical impedance spectroscopy (EIS) is a characterization technique widely used to evaluate the properties of electrochemical systems. The distribution of relaxation times (DRT) has emerged as a model-free alternative to equivalent circuits and physical models to circumvent the inherent challenges of EIS…