Search

The Banach Gelfand Triple ( S 0 , L 2 , S 0 ′ ) ( R d ) consists of S 0 ( R d ) , ∥ · ∥ S 0 , a very specific Segal algebra as algebra of test functions, the Hilbert space L 2 ( R d ) , ∥ · ∥ 2 and the dual space S 0 ′ ( R d ) , whose elements are also called “mild distributions”. Together they provide a universal tool for Fourier Analysis in its many manifestations. It is indispensable for a proper formulation of Gabor Analysis, but also useful for a distributional description of the classical (generalized) Fourier transform (with Plancherel’s Theorem and the Fourier Inversion Theorem as core statements) or the foundations of Abstract Harmonic Analysis, as it is not difficult to formulate this theory in the context of locally compact Abelian (LCA) groups. A new approach presented recently allows to introduce S 0 ( R d ) , ∥ · ∥ S 0 and hence ( S 0 ′ ( R d ) , ∥ · ∥ S 0 ′ ) , the space of “mild distributions”, without the use of the Lebesgue integral or the theory of tempered distributions. The present notes will describe an alternative, even more elementary approach to the same objects, based on the idea of completion (in an appropriate sense). By drawing the analogy to the real number system, viewed as infinite decimals, we hope that this approach is also more interesting for engineers. Of course it is very much inspired by the Lighthill approach to the theory of tempered distributions. The main topic of this article is thus an outline of the sequential approach in this concrete setting and the clarification of the fact that it is just another way of describing the Banach Gelfand Triple. The objects of the extended domain for the Short-Time Fourier Transform are (equivalence classes) of so-called mild Cauchy sequences (in short ECmiCS). Representatives are sequences of bounded, continuous functions, which correspond in a natural way to mild distributions as introduced in earlier papers via duality theory. Our key result shows how standard functional analytic arguments combined with concrete properties of the Segal algebra S 0 ( R d ) , ∥ · ∥ S 0 can be used to establish this natural identification.

We establish a Fourier inversion theorem for general connected, simply connected nilpotent Lie groups $$G= \hbox {exp}({\mathfrak {g}})$$ by showing that operator fields defined on suitable sub-manifolds of $${\mathfrak {g}}^*$$ are images of Schwartz functions under the Fourier transform. As an application of this result, we provide a complete characterisation of a large class of invariant prime closed two-sided ideals of $$L^1(G)$$ as kernels of sets of irreducible representations of G.

The paper deals with the generalization of Fourier-type relations in the context of fractional-order calculus. The instantaneous temperature-flux equation of the Fourier-type diffusion is generalized, introducing a self-similar, fractal-type mass clustering at the micro scale. In this setting, the resulting conduction equation at the macro scale yields a Caputo's fractional derivative with order [0,1] of temperature gradient that generalizes the Fourier conduction equation. The order of the fractional-derivative has been related to the fractal assembly of the microstructure and some preliminary observations about the thermodynamical restrictions of the coefficients and the state functions related to the fractional-order Fourier equation have been introduced. The distribution and temperature increase in simple rigid conductors have also been reported to investigate the influence of the derivation order in the temperature field. (C) 2017 American Society of Civil Engineers.

The non-commutativity of the Clifford multiplication gives different aspects from the classical Fourier analysis.We establish main properties of convolution theorems for the Clifford Fourier transform. Some properties of these generalized convolutionsare extensions of the corresponding convolution theorems of the classical Fourier transform.DOI : http://dx.doi.org/10.22342/jims.20.2.143.125-140

For a bivariate function on a square, in general, its Fourier coefficients decay slowly, so one cannot reconstruct it by few Fourier coefficients. In this paper we will develop a new approximation scheme to overcome the weakness of Fourier approximation. In detail, we will use Lagrange interpolation and linear interpolation on the boundary of the square to derive a new approximation scheme such that we can use the values of the target function at vertices of the square and few Fourier coefficients to reconstruct the target function with very small error.

We consider a nontrivial example of distributional eigenfunction of the planar Fourier transform. This eigenfunction is not a tensor product of univariate eigenfunctions. As a consequence, we obtain a formula for multi-dimensional eigenfunctions in dimension 2N.

WOS: 000416484100008 We generalize a main theorem dealing with absolute weighted mean summability of Fourier series to the |A, p(n)|(k) summability factors of Fourier series under weaker conditions. Also some new and known results are obtained.

International audience; We propose a generalization of a classical result on random Fourier series, namely the Billard Theorem, for random Fourier series over the d-dimensional torus. We provide an investigation of the independence with respect to a choice of a sequence of partial sums (or method of summation). We also study some probabilistic properties of the resulting sum field such as stationarity and characteristics of the marginal distribution.

We present a new formulation of Fourier transform in the picture of the $\kappa$-algebra derived in the framework of the $\kappa$-generalized statistical mechanics. The $\kappa$-Fourier transform is obtained from a $\kappa$-Fourier series recently introduced by us [2013 Entropy {\bf15} 624]. The kernel of this transform, that reduces to the usual exponential phase in the $\kappa\to0$ limit, is composed by a $\kappa$-deformed phase and a damping factor that gives a wavelet-like behavior. We show that the $\kappa$-Fourier transform is isomorph to the standard Fourier transform through a changing of time and frequency variables. Nevertheless, the new formalism is useful to study, according to Fourier analysis, those functions defined in the realm of the $\kappa$-algebra. As a relevant application, we discuss the central limit theorem for the $\kappa$-sum of $n$-iterate statistically independent random variables., Comment: 31 pages, 6 figures, elsart stile

In recent years, a number of works have studied methods for computing the Fourier transform in sublinear time if the output is sparse. Most of these have focused on the discrete setting, even though in many applications the input signal is continuous and naive discretization significantly worsens the sparsity level. We present an algorithm for robustly computing sparse Fourier transforms in the continuous setting. Let $x(t) = x^*(t) + g(t)$, where $x^*$ has a $k$-sparse Fourier transform and $g$ is an arbitrary noise term. Given sample access to $x(t)$ for some duration $T$, we show how to find a $k$-Fourier-sparse reconstruction $x'(t)$ with $$\frac{1}{T}\int_0^T |x'(t) - x(t) |^2 \mathrm{d} t \lesssim \frac{1}{T}\int_0^T | g(t)|^2 \mathrm{d}t.$$ The sample complexity is linear in $k$ and logarithmic in the signal-to-noise ratio and the frequency resolution. Previous results with similar sample complexities could not tolerate an infinitesimal amount of i.i.d. Gaussian noise, and even algorithms with higher sample complexities increased the noise by a polynomial factor. We also give new results for how precisely the individual frequencies of $x^*$ can be recovered., FOCS 2015

Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration, and complex structure. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has all the required basic properties. As an example we discuss a sawtooth signal on the ternary middle-third Cantor set. The formalism works also for fractals that are not self-similar.

Sufficient conditions for the convergence (almost everywhere) of multiple trigonometric Fourier series of functions $f$ in the classes $L_p$, $p>1$, are obtained in the case where rectangular partial sums $S_n(x;f)$ of this series have numbers $n=(n_1,\dots,n_N)\in \mathbb Z^N$, $N\geq 3$, such that of $N$ components only $k$ ($1\leq k\leq N-2$) are elements of some lacunary sequences. Earlier, in the case where $N-1$ components of the number $n$ are elements of lacunary sequences, convergence almost everywhere for multiple Fourier series was obtained for functions in the classes $L_p$, $p>1$, by M. Kojima (1977), and for functions in Orlizc classes by D. K. Sanadze, Sh. V. Kheladze (1977) and N. Yu. Antonov (2014). Note that presence of two or more “free” components in the number $n$, as follows from the results by Ch. Fefferman (1971) and M. Kojima (1977), does not guarantee the convergence almost everywhere of $S_n(x;f)$ for $N\geq 3$ even in the class of continuous functions.

International audience; The paper studies the vector space of set functions on a finite set X, which can be alternatively seen as pseudo-Boolean functions, and including as a special cases games. We present several bases (unanimity games, Walsh and parity functions) and make an emphasis on the Fourier transform. Then we establish the basic dual-ity between bases and invertible linear transform (e.g., the Möbius transform, the Fourier transform and interaction transforms). We apply it to solve the well-known inverse problem in cooperative game theory (find all games with same Shapley value), and to find various equivalent expressions of the Choquet integral.

We propose Anisotropic Windowed Fourier Transform (AWFT), a framework for localized space-frequency analysis of deformable 3D shapes. With AWFT, we are able to extract meaningful intrinsic localized orientation-sensitive structures on surfaces, and use them in applications such as shape segmentation, salient point detection, feature point description, and matching. Our method outperforms previous approaches in the considered applications.

We introduce a method to recover a continuous domain representation of a piecewise constant two-dimensional image from few low-pass Fourier samples. Assuming the edge set of the image is localized to the zero set of a trigonometric polynomial, we show the Fourier coefficients of the partial derivatives of the image satisfy a linear annihilation relation. We present necessary and sufficient conditions for unique recovery of the image from finite low-pass Fourier samples using the annihilation relation. We also propose a practical two-stage recovery algorithm which is robust to model-mismatch and noise. In the first stage we estimate a continuous domain representation of the edge set of the image. In the second stage we perform an extrapolation in Fourier domain by a least squares two-dimensional linear prediction, which recovers the exact Fourier coefficients of the underlying image. We demonstrate our algorithm on the super-resolution recovery of MRI phantoms and real MRI data from low-pass Fourier samples, which shows benefits over standard approaches for single-image super-resolution MRI., Comment: Accepted for publication in SIAM Journal on Imaging Sciences

The familiar Beurling theorem (an uncertainty principle), which is known for the Fourier transform pairs, has recently been proved by the author for the Kontorovich-Lebedev transform. In this paper analogs of the Beurling theorem are established for certain index transforms with respect to a parameter of the modified Bessel functions. In particular, we treat the generalized Lebedev-Skalskaya transforms, the Lebedev type transforms involving products of the Macdonald functions of different arguments and an index transform with the Nicholson kernel function. We also find inversion formulas for the Lebedev-Skalskaya operators of an arbitrary index and the Nicholson kernel transform.

The Fourier dimension is not in general stable under finite unions of sets. Moreover, the stability of the Fourier dimension on particular pairs of sets is independent from the stability of the compact Fourier dimension., Improves one of the results of arXiv:1406.1480

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$ with $T>1$, a technique called Fourier extension or Fourier continuation. When constructed as the discrete least squares minimizer in equidistant points, the Fourier extension has been shown shown to converge geometrically in the truncation parameter $N$. A fast ${\mathcal O}(N \log^2 N)$ algorithm has been described to compute Fourier extensions for the case where $T=2$, compared to ${\mathcal O}(N^3)$ for solving the dense discrete least squares problem. We present two ${\mathcal O}(N\log^2 N )$ algorithms for the computation of these approximations for the case of general $T$, made possible by exploiting the connection between Fourier extensions and Prolate Spheroidal Wave theory. The first algorithm is based on the explicit computation of so-called periodic discrete prolate spheroidal sequences, while the second algorithm is purely algebraic and only implicitly based on the theory.

We study the Fourier transform of the absolute value of a polynomial on a finite-dimensional vector space over a local field of characteristic 0. We prove that this transform is smooth on an open dense set. We prove this result for the Archimedean and the non-Archimedean case in a uniform way. The Archimedean case was proved in [Ber]. The non-Archimedean case was proved in [HK] and [CL]. Our method is different from those described in [Ber,HK,CL]. It is based on Hironaka's desingularization theorem, unlike [Ber] which is based on the theory of D-modules and [HK,CL] which is based on model theory. Our method also gives bounds on the open dense set where the Fourier transform is smooth. These bounds are explicit in terms of resolution of singularities. We also prove the same result on the Fourier transform of other measures of algebraic origins., Comment: 40 pages

We present a Fourier transform representation of the gamma functions, which leads naturally to a distributional representation for them. Both of these representations lead to new identities for the integrals of gamma functions multiplied by other functions, which are also presented here.

The Simpson discrete Fourier transform (SDFT) and its inverse are transformations relating the time and frequency domains. In this paper we state and prove the important properties of shift, circular convolution, conjugation, time reversal and Plancherel's theorem. In addition, we provide an alternative representation of the duality property.Quaestiones Mathematicae 37(2014), 279-290

Fourier analysis is a powerful tool for many problems, and especially for solving various differential equations of interest in science and engineering. In the present paper since the utilization of Zadeh’s Extension principle is quite difficult in practice, we prefer the idea of level sets in order to construct a fuzzy-valued function on a closed interval via related membership function. We derive uniform convergence of a fuzzy-valued function sequences and series with level sets. Also we study Hukuhara differentiation and Henstock integration of a fuzzy-valued function with some necessary inclusions. Furthermore, Fourier series of periodic fuzzy-valued functions is defined and its complex form is given via sine and cosine fuzzy coefficients with an illustrative example. Finally, by using the Dirichlet kernel and its properties, we especially examine the convergence of Fourier series of fuzzy-valued functions at each point of discontinuity, where one-sided limits exist.

Although spectral analysis of stationary stochastic processes has solid mathematical foundations, this is not always so for some non-stationary cases. Here, we establish a rigorous mathematical extension of the classic Fourier spectrum to the case in which there are AR roots in the unit circle, ie, the transfer function of the linear time-invariant filter has poles on the unit circle. To achieve it we: embed the classical problem in a wider framework, the Rigged Hilbert space, extend the Discrete Time Fourier Transform and defined a new Extended Fourier Transform pair pseudo-covariance function/pseudo-spectrum. Our approach is a proper extension of the classical spectral analysis, within which the Fourier Transform pair auto-covariance function/spectrum is a particular case. Consequently spectrum and pseudo-spectrum coincide when the first one is defined.

We prove the Paley–Wiener theorem for the Helgason Fourier transform of smooth compactly supported biradial functions on a Damek–Ricci space S = NA . © 2014 Published by Elsevier Inc.

Submitted by Luís Castro (castro@ua.pt) on 2016-12-27T20:22:12Z No. of bitstreams: 1 AFA-tex_v5_n1_a2.pdf: 319844 bytes, checksum: 87a177497b816b8300192fd0562160c9 (MD5) Approved for entry into archive by Bella Nolasco(bellanolasco@ua.pt) on 2017-01-13T12:37:10Z (GMT) No. of bitstreams: 1 AFA-tex_v5_n1_a2.pdf: 319844 bytes, checksum: 87a177497b816b8300192fd0562160c9 (MD5) Made available in DSpace on 2017-01-13T12:37:11Z (GMT). No. of bitstreams: 1 AFA-tex_v5_n1_a2.pdf: 319844 bytes, checksum: 87a177497b816b8300192fd0562160c9 (MD5) Previous issue date: 2014

Consider an integrable function f on the torus T m , with Fourier coefficients f ˜ ( n ) , n ∈ Z m . For functions with support in a neighbourhood of the origin, we describe the support by means of l p -growth properties of difference operators acting on the Fourier coefficients f ˜ ( n ) . We then generalize the result to compact Lie groups, using a certain Weyl group invariant difference operator. We also consider l 2 -Bernstein inequalities for the difference operators.

We report on inversion of the Fourier transform when the frequency variable can be scaled in a variety of different ways that improve the resolution of certain parts of the frequency domain. The corresponding inverse Fourier transform is shown to exist in the form of two dual scale-frequency series. Upon discretization of the continuous scale factor, this Fourier transform series inverse becomes a certain nonharmonic double series, a discretized scale-frequency (DSF) series. The DSF series is also demonstrated, theoretically and practically, to be rate-optimizable with respect to its two free parameters, when it satisfies, as an entropy maximizer, a pertaining recursive nonlinear programming problem incorporating the entropy-based uncertainty principle.

A method is described for inverting the Laplace transform. The performance of the Fourier method is illustrated by the inversion of the test functions available in the literature. Results are shown in the tables.

Hypercomplex Fourier transforms are increasingly used in signal processing for the analysis of higher-dimensional signals such as color images. A main stumbling block for further applications, in particular concerning filter design in the Fourier domain, is the lack of a proper convolution theorem. The present paper develops and studies two conceptually new ways to define convolution products for such transforms. As a by-product, convolution theorems are obtained that will enable the development and fast implementation of new filters for quaternionic signals and systems, as well as for their higher dimensional counterparts., 18 pages, two columns, accepted in J. Math. Imaging Vision

WOS; International audience; Statistical properties of real-valued symmetric alpha-stable noise after short-time Fourier transformation are derived. Circularity, stationarity and dependence between the real and imaginary components are studied as a function of the STFT parameters and the stability index alpha.

We propose in this paper to introduce a new spinor Fourier transform for both grey-level and color image processing. Our approach relies on the three following considerations: mathematically speaking, defining a Fourier transform requires to deal with group actions; vectors of the acquisition space can be considered as generalized numbers when embedded in a Clifford algebra; the tangent space of the image surface appears to be a natural parameter of the transform we define by means of so-called spin characters. The resulting spinor Fourier transform may be used to perform frequency filtering that takes into account the Riemannian geometry of the image. We give examples of low-pass filtering interpreted as diffusion process. When applied to color images, the entire color information is involved in a really non marginal process.

General convolution theorems for two-dimensional quaternion Fourier transforms (QFTs) are presented. It is shown that these theorems are valid not only for real-valued functions but also for quaternion-valued functions. We describe some useful properties of generalized convolutions and compare them with the convolution theorems of the classical Fourier transform. We finally apply the obtained results to study hypoellipticity and to solve the heat equation in quaternion algebra framework.

The paper introduces a new concept of Λ-variation of multivariable functions and studies its relationship with the convergence of multidimensional Fourier series. Введено нову концепцію Λ-варiацiї функцій багатьох змінних та вивчено її зв'язок зі з6іжністю багатовимiрних рядів Фур'є.

13p.; We prove a comparison theorem between Fourier transform without support and and Fourier transform with compact support in the context of arithmetic $\DD$-modules.

Recently, the butterfly approximation scheme was proposed for computing Fourier transforms with sparse and smooth sampling in the frequency and spatial domains. We present a rigorous error analysis which shows how the local expansion degree depends on the target accuracy and the nonharmonic bandwidth. Moreover, we show that the original scheme becomes numerically unstable if a large local expansion degree is used. This problem is removed by representing all approximations in a Lagrange-type basis instead of the previously used monomial basis. All theoretical results are illustrated by numerical experiments.

Meaningful upper bounds for the Fourier transform of polynomial exponential functions are often hard to come by. Regarding Fourier transforms of rational exponential functions, which are of importance, for example in Campbell's sampling theorem, the purpose of finding significant upper bounds is an even more demanding exercise. In this article, we propose a new approach in order to obtain significant upper bounds for Fourier transforms of general exponential functions. The technique is shown to allow further generalization in order to deal with Fourier-like integrals and rational exponential integrals.

We propose a new representation of the Schrodinger operator of a free particle by using the short-time Fourier transform and give its applications.

Functions that are smooth but non-periodic on a certain interval possess Fourier series that lack uniform convergence and suffer from the Gibbs phenomenon. However, they can be represented accurately by a Fourier series that is periodic on a larger interval. This is commonly called a Fourier extension. When constructed in a particular manner, Fourier extensions share many of the same features of a standard Fourier series. In particular, one can compute Fourier extensions which converge spectrally fast whenever the function is smooth, and exponentially fast if the function is analytic, much the same as the Fourier series of a smooth/analytic and periodic function. With this in mind, the purpose of this paper is to describe, analyze and explain the observation that Fourier extensions, much like classical Fourier series, also have excellent resolution properties for representing oscillatory functions. The resolution power, or required number of degrees of freedom per wavelength, depends on a user-controlled parameter and, as we show, it varies between 2 and \pi. The former value is optimal and is achieved by classical Fourier series for periodic functions, for example. The latter value is the resolution power of algebraic polynomial approximations. Thus, Fourier extensions with an appropriate choice of parameter are eminently suitable for problems with moderate to high degrees of oscillation., Comment: Revised version

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 transform. This Fourier transform can be considered as a two-parameter extension, with a quadratic term, of the usual discrete Fourier transform. In the case where the two parameters are taken to be equal to zero, the quadratic discrete Fourier transform is nothing but the usual discrete Fourier transform. The quantum quadratic discrete Fourier transform plays an important role in the field of quantum information. In particular, such a transformation in prime dimension can be used for obtaining a complete set of mutually unbiased bases.

Let μ be a compactly supported absolutely continuous probability measure on Rn, we show that L2(K,dμ) admits a Fourier frame if and only if its Radon–Nikodym derivative is bounded above and below almost everywhere on the support K. As a consequence, we prove that if μ is an equal weight absolutely continuous self-similar measure on R1 and L2(K,dμ) admits a Fourier frame, then the density of μ must be a characteristic function of self-similar tile. In particular, this shows for almost everywhere 1/2

We present a new formula for the Fourier transform of a Lorentz invariant temperate distribution. The formula is applied so as to yield the temperate fundamental solution of the Klein-Gordon operator.

The aim of this paper is to prove two new uncertainty principles for the Fourier-Bessel transform (or Hankel transform). The first of these results is an extension of a result of Amrein-Berthier-Benedicks, it states that a non zero function $f$ and its Fourier-Bessel transform $\mathcal{F}_\alpha (f)$ cannot both have support of finite measure. The second result states that the supports of $f$ and $\mathcal{F}_\alpha (f)$ cannot both be $(\eps,\alpha)$-thin, this extending a result of Shubin-Vakilian-Wolff. As a side result we prove that the dilation of a $\cc_0$-function are linearly independent. We also extend Faris's local uncertainty principle to the Fourier-Bessel transform., Comment: 19pp

Recently, there has been an increasing interest in the study of hypercomplex signals and their Fourier transforms. This paper aims to study such integral transforms from general principles, using 4 different yet equivalent definitions of the classical Fourier transform. This is applied to the so-called Clifford-Fourier transform (see [F. Brackx et al., The Clifford-Fourier transform. J. Fourier Anal. Appl. 11 (2005), 669--681]). The integral kernel of this transform is a particular solution of a system of PDEs in a Clifford algebra, but is, contrary to the classical Fourier transform, not the unique solution. Here we determine an entire class of solutions of this system of PDEs, under certain constraints. For each solution, series expressions in terms of Gegenbauer polynomials and Bessel functions are obtained. This allows to compute explicitly the eigenvalues of the associated integral transforms. In the even-dimensional case, this also yields the inverse transform for each of the solutions. Finally, several properties of the entire class of solutions are proven., 30 pages, accepted for publication in J. Fourier Anal. Appl

We study Fourier theory on quantum Euclidean space. A modified version of the general definition of the Fourier transform on a quantum space is used and its inverse is constructed. The Fourier transforms can be defined by their Bochner's relations and a new type of q-Hankel transforms using the first and second q-Bessel functions. The behavior of the Fourier transforms with respect to partial derivatives and multiplication with variables is studied. The Fourier transform acts between the two representation spaces for the harmonic oscillator on quantum Euclidean space. By using this property it is possible to define a Fourier transform on the entire Hilbert space of the harmonic oscillator, which is its own inverse and satisfies the Parseval theorem.