English
Related papers

Related papers: Fourier analysis of spatial point processes

200 papers

The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…

Information Theory · Computer Science 2014-10-09 Mansoor I. Yousefi , Frank R. Kschischang

The emergence of alternative multiplexing domains to the time-frequency domains, e.g., the delay-Doppler and chirp domains, offers a promising approach for addressing the challenges posed by complex propagation environments and…

Signal Processing · Electrical Eng. & Systems 2025-10-15 Abdelali Arous , Hamza Haif , Arman Farhang , Huseyin Arslan

The usual fluid equations describing the large-scale evolution of mass density in the universe can be written as local in the density, velocity divergence, and velocity potential fields. As a result, the perturbative expansion in small…

Cosmology and Nongalactic Astrophysics · Physics 2016-06-01 Marcel Schmittfull , Zvonimir Vlah , Patrick McDonald

Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…

Data Structures and Algorithms · Computer Science 2015-08-27 H. M. de Oliveira , R. J. Cintra , R. M. Campello de Souza

Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…

Information Theory · Computer Science 2012-05-23 Mojtaba Vaezi , Fabrice Labeau

Fast Fourier Transforms (FFT) are widely used to reduce memory and computational costs in deep learning. However, existing implementations, including standard FFT and real FFT (rFFT), cannot achieve true in-place computation. In particular,…

Machine Learning · Computer Science 2025-12-23 Xinyu Ding , Bangtian Liu , Siyu Liao , Zhongfeng Wang

Two-Dimensional (2D) Discrete Fourier Transform (DFT) is a basic and computationally intensive algorithm, with a vast variety of applications. 2D images are, in general, non-periodic, but are assumed to be periodic while calculating their…

Computer Vision and Pattern Recognition · Computer Science 2016-03-17 Faisal Mahmood , Märt Toots , Lars-Göran Öfverstedt , Ulf Skoglund

Spatial and temporal delays in a wireless multi-antenna system, paired with an orthogonal frequency division multiplexing (OFDM) waveform, can be utilized to estimate the Angle of Arrival (AoA) and Time of Arrival (ToA) of scatterers in the…

Signal Processing · Electrical Eng. & Systems 2025-03-25 Chandrashekhar Rai , Debarati Sen

In many processes, the variations in underlying characteristics can be approximated by noisy multi-periodic patterns. If large-scale patterns are superimposed by a noise with long-range correlations, the detection of multi-periodic patterns…

Quantitative Methods · Quantitative Biology 2019-12-09 V. R. Chechetkin , V. V. Lobzin

In this article, we propose a spectral method for a class of multivariate inhomogeneous spatial point processes, namely the second-order intensity reweighted stationary processes. A key ingredient of our approach is utilizing the asymptotic…

Methodology · Statistics 2025-10-22 Qi-Wen Ding , Junho Yang , Joonho Shin

Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…

Information Theory · Computer Science 2015-06-05 Mojtaba Vaezi , Fabrice Labeau

We have designed and constructed a ``dispersed Fourier Transform Spectrometer'' (dFTS), consisting of a conventional FTS followed by a grating spectrometer. By combining these two devices, we negate a substantial fraction of the sensitivity…

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.…

Machine Learning · Computer Science 2020-08-31 Yong-chan Park , Jun-Gi Jang , U Kang

The specification of a covariance function is of paramount importance when employing Gaussian process models, but the requirement of positive definiteness severely limits those used in practice. Designing flexible stationary covariance…

Computation · Statistics 2024-05-01 Paul G. Beckman , Christopher J. Geoga

Analyzing time series in the frequency domain enables the development of powerful tools for investigating the second-order characteristics of multivariate processes. Parameters like the spectral density matrix and its inverse, the coherence…

Methodology · Statistics 2024-01-19 Jonas Krampe , Efstathios Paparoditis

The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing…

Computational Physics · Physics 2026-05-26 Julio Delgado , Alejandro Umaña

To comprehensively assess optical fiber communication system conditions, it is essential to implement joint estimation of the following four critical impairments: nonlinear signal-to-noise ratio (SNRNL), optical signal-to-noise ratio…

Signal Processing · Electrical Eng. & Systems 2023-08-29 Ting Jiang , Zheng Gao , Yizhao Chen , Zihe Hu , Ming Tang

Source wavelet estimation is the key in seismic signal processing for resolving subsurface structural properties. Homomorphic deconvolution using cepstrum analysis has been an effective method for wavelet estimation for decades. In general,…

Information Theory · Computer Science 2012-06-06 K. H. Miah , R. H. Herrera , M. van der Baan , M. D. Sacchi

We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$…

Signal Processing · Electrical Eng. & Systems 2021-10-07 P Charantej Reddy , V S S Prabhu Tej , Aditya Siripuram , Brad Osgood

We present a parallel version of the well-known Split-Step Fourier method (SSF) for solving the Nonlinear Schr\"odinger equation, a mathematical model describing wave packet propagation in fiber optic lines. The algorithm is implemented…

Computational Physics · Physics 2007-05-23 S. M. Zoldi , V. Ruban , A. Zenchuk , S. Burtsev
‹ Prev 1 4 5 6 7 8 10 Next ›