Related papers: Multi-dimensional properties of One-dimensional di…
Photonic computing has emerged as a promising platform for accelerating computational tasks with high degrees of parallelism, such as image processing and neural network. We present meta-DFT (discrete Fourier transform), a single layer…
We propose a multi-dimensional (M-D) sparse Fourier transform inspired by the idea of the Fourier projection-slice theorem, called FPS-SFT. FPS-SFT extracts samples along lines (1-dimensional slices from an M-D data cube), which are…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
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…
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.…
Unlike covalent two-dimensional (2D) materials like graphene, 2D metals have non-layered structures due to their non-directional, metallic bonding. While experiments on 2D metals are still scarce and challenging, density-functional theory…
Various relations between conformal quantum field theories in one, two and four dimensions are explored. The intention is to obtain a better understanding of 4D CFT with the help of methods from lower dimensional CFT.
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…
The present chapter [submitted for publication in "Fourier Transforms, Theory and Applications", G. Nikolic (Ed.), InTech (Open Access Publisher), Vienna, 2011] is concerned with the introduction and study of a quadratic discrete Fourier…
Optical two-dimensional Fourier-transformed (2DFT) spectroscopy is used to study the coherent optical response of potassium vapor in a thin transmission cell. Rephasing and non-rephasing spectra of the D1 and D2 transitions are obtained and…
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…
Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more…
Multi-dimensional discrete Fourier transforms (DFT) are typically decomposed into multiple 1D transforms. Hence, parallel implementations of any multi-dimensional DFT focus on parallelizing within or across the 1D DFT. Existing DFT packages…
The Fractional Fourier Transform (FRFT) has been playing a unique and increasingly important role in signal and image processing. In this letter, we investigate the property of frequency shift in two-dimensional FRFT (2D-FRFT) domain. It is…
Density functional theory (DFT), the most widely adopted method in modern computational chemistry, fails to describe accurately the electronic structure of strongly correlated systems. Here we show that DFT can be formally and practically…
The analysis of multi-dimensional graph signals on complex structured domains remains a fundamental challenge,
One-dimensional detrended fluctuation analysis (1D DFA) and multifractal detrended fluctuation analysis (1D MF-DFA) are widely used in the scaling analysis of fractal and multifractal time series because of being accurate and easy to…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
A binary vector of length $N$ has elements that are either 0 or 1. We investigate the question of whether and how a binary vector of known length can be reconstructed from a limited set of its discrete Fourier transform (DFT) coefficients.…