Related papers: Fractional Fourier Sound Synthesis
Discrete Fourier Transform (DFT) is widely used in signal processing to analyze the frequencies in a discrete signal. However, DFT fails to recover the exact Fourier spectrum, when the signal contains frequencies that do not correspond to…
Fourier transform has become a basic tool for analyzing biological signals 1,2,3. Mostly a fast Fourier transform is computed for a finite sequence of data sample 4. This is the standard way apparatuses and modern computerized technology…
The short-time Fourier transform (STFT) is a time-frequency representation widely used in applications, for example in audio signal processing. Recently it has been shown that not only the amplitude, but also the phase of this…
In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another.…
The Fast Fourier Transform (FFT) is one of the most widely used algorithms in high performance computing, with critical applications in spectral analysis for both signal processing and the numerical solution of partial differential…
Fast Fourier Transforms (FFTs) are exploited in a wide variety of fields ranging from computer science to natural sciences and engineering. With the rising data production bandwidths of modern FFT applications, judging best which…
This study puts forward a generalization of the short-time Fourier-based Synchrosqueezing Transform using a new local estimate of instantaneous frequency. Such a technique enables not only to achieve a highly concentrated time-frequency…
In the field of digital signal processing, the fast Fourier transform (FFT) is a fundamental algorithm, with its processors being implemented using either the pipelined architecture, well-known for high-throughput applications but weak in…
The quaternion Fourier transform (qFT) is an important tool in multi-dimensional data analysis, in particular for the study of color images. An important problem when applying the qFT is the mismatch between the spatial and frequency…
Fourier transform spectroscopy (FTS) has been widely used as an analytical tool for many applications in science and engineering. In this paper, we describe the operation principle and practical implementation of an FTS prototype. First,…
Phase-space analysis or time-frequency analysis can be thought as Fourier analysis simultaneously both in time and in frequency, originating from signal processing and quantum mechanics. On groups having unitary Fourier transform, we…
The scattering transform is a non-linear signal representation method based on cascaded wavelet transform magnitudes. In this paper we introduce phase scattering, a novel approach where we use phase derivatives in a scattering procedure. We…
We introduce a new numerical method for solving time-harmonic acoustic scattering problems. The main focus is on plane waves scattered by smoothly varying material inhomogeneities. The proposed method works for any frequency $\omega$, but…
With the emergence of GAN-based vocoders, the discriminator, as a crucial component, has been developed recently. In our work, we focus on improving the time-frequency based discriminator. Particularly, Short-Time Fourier Transform (STFT)…
Communication efficiency is a widely recognised research problem in Federated Learning (FL), with recent work focused on developing techniques for efficient compression, distribution and aggregation of model parameters between clients and…
This technical note is on digital filters for the high-fidelity estimation of a sinusoidal signal's frequency in the presence of additive noise. The complex noise is assumed to be white (i.e. uncorrelated) however it need not be Gaussian.…
This article introduces a new parametric synthesis method for sound textures based on existing works in visual and sound texture synthesis. Starting from a base sound signal, an optimization process is performed until the cross-correlations…
The graph fractional Fourier transform (GFRFT) applies a single global fractional order to all graph frequencies, which restricts its adaptability to diverse signal characteristics across the spectral domain. To address this limitation, in…
Fast Fourier transform (FFT) of large number of samples requires huge hardware resources of field programmable gate arrays (FPGA), which needs more area and power. In this paper, we present an area efficient architecture of FFT processor…
This paper is devoted to the $L^p(\mathbb R)$ theory of the fractional Fourier transform (FRFT) for $1\le p < 2$. In view of the special structure of the FRFT, we study FRFT properties of $L^1$ functions, via the introduction of a suitable…