首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this present article, we study the fractional Hankel transform and its inverse on certain Gel'fand‐Shilov spaces of type S. The continuous fractional wavelet transform is defined involving the fractional Hankel transform. The continuity of fractional Hankel wavelet transform is discussed on Gel'fand‐Shilov spaces of type S. This article goes further to discuss the continuity property of fractional Hankel transform and fractional Hankel wavelet transform on the ultradifferentiable function spaces.  相似文献   

2.
Using the theory of Hankel convolution, continuous and discrete Bessel wavelet transforms are defined. Certain boundedness results and inversion formula for the continuous Bessel wavelet transform are obtained. Important properties of the discrete Bessel wavelet transform are given.  相似文献   

3.
The aim of this paper is to prove Heisenberg-type uncertainty principles for the continuous Hankel wavelet transform. We also analyse the concentration of this transform on sets of finite measure. Benedicks-type uncertainty principle is given.  相似文献   

4.
Shapiro’s dispersion and Umbrella theorems are proved for the continuous Hankel wavelet transform. As a side results, we extend local uncertainty principles for set of finite measure to the latter transform.  相似文献   

5.
This article is concerned with the study of the continuity of wavelet transform involving fractional Hankel transform on certain function spaces. The n-dimensional boundedness property of the fractional wavelet transform is also discussed on Sobolev type space. Particular cases are also considered.  相似文献   

6.
Spherical wavelet transform and its discretization   总被引:3,自引:0,他引:3  
A continuous version of spherical multiresolution is described, starting from continuous wavelet transform on the sphere. Scale discretization enables us to construct spherical counterparts to wavelet packets and scale discrete wavelets. The essential tool is the theory of singular integrals on the sphere. It is shown that singular integral operators forming a semigroup of contraction operators of class (C 0) (like Abel-Poisson or Gauß-Weierstraß operators) lead in a canonical way to (pyramidal) algorithms.Supported by the Graduiertenkolleg Technomathematik, Kaiserslautern.  相似文献   

7.
As a time‐shifted and frequency‐modulated version of the linear canonical transform (LCT), the offset linear canonical transform (OLCT) provides a more general framework of most existing linear integral transforms in signal processing and optics. To study simultaneous localization of a signal and its OLCT, the classical Heisenberg's uncertainty principle has been recently generalized for the OLCT. In this paper, we complement it by presenting another two uncertainty principles, ie, Donoho‐Stark's uncertainty principle and Amrein‐Berthier‐Benedicks's uncertainty principle, for the OLCT. Moreover, we generalize the short‐time LCT to the short‐time OLCT. We likewise present Lieb's uncertainty principle for the short‐time OLCT and give a lower bound for its essential support.  相似文献   

8.
We investigate the octonion short-time linear canonical transform (OCSTLCT) in this paper. First, we propose the new definition of the OCSTLCT, and then several important properties of newly defined OCSTLCT, such as bounded, shift, modulation, time-frequency shift, inversion formula, and orthogonality relation, are derived based on the spectral representation of the octonion linear canonical transform (OCLCT). Second, by the Heisenberg uncertainty principle for the OCLCT and the orthogonality relation property for the OCSTLCT, the Heisenberg uncertainty principle for the OCSTLCT is established. Finally, we give an example of the OCSTLCT.  相似文献   

9.
Fourier analysis plays a vital role in the analysis of continuous‐time signals. In many cases, we are forced to approximate the Fourier coefficients based on a sampling of the time signal. Hence, the need for a discrete transformation into the frequency domain giving rise to the classical discrete Fourier transform. In this paper, we present a transformation that arises naturally if one approximates the Fourier coefficients of a continuous‐time signal numerically using the Simpson quadrature rule. This results in a decomposition of the discrete signal into two sequences of equal length. We show that the periodic discrete time signal can be reconstructed completely from its discrete spectrum using an inverse transform. We also present many properties satisfied by this transform. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

10.
ABSTRACT

In this paper, we present some new elements of harmonic analysis related to the right-sided multivariate continuous quaternion wavelet transform. The main objective of this article is to introduce the concept of the right-sided multivariate continuous quaternion wavelet transform and investigate its different properties using the machinery of multivariate quaternion Fourier transform. Last, we have proven a number of uncertainty principles for the right-sided multivariate continuous quaternion wavelet transform.  相似文献   

11.
The Hankel transform is an important transform. In this paper, we study thewavelets associated with the Hankel transform, then define the Weyl transform of thewavelets. We give criteria of its boundedness and compactness on the L~p-spaces.  相似文献   

12.
A review of system identification based on distribution theory is given. By the Schwartz kernel theorem, to every continuous linear system there corresponds a unique distribution, called kernel distribution. Formulae using wavelet transform to access time--frequency information of kernel distributions are deduced. A new wavelet-based system identification method for health monitoring systems is proposed as an application of a discretized formula using stationary wavelet transform.  相似文献   

13.
In this paper we introduce the continuous quaternion wavelet transform (CQWT). We express the admissibility condition in terms of the (right-sided) quaternion Fourier transform. We show that its fundamental properties, such as inner product, norm relation, and inversion formula, can be established whenever the quaternion wavelets satisfy a particular admissibility condition. We present several examples of the CQWT. As an application we derive a Heisenberg type uncertainty principle for these extended wavelets.  相似文献   

14.
Prolate spheroidal wave functions (PSWFs) possess many remarkable properties. They are orthogonal basis of both square integrable space of finite interval and the Paley–Wiener space of bandlimited functions on the real line. No other system of classical orthogonal functions is known to obey this unique property. This raises the question of whether they possess these properties in Clifford analysis. The aim of the article is to answer this question and extend the results to more flexible integral transforms, such as offset linear canonical transform. We also illustrate how to use the generalized Clifford PSWFs (for offset Clifford linear canonical transform) we derive to analyze the energy preservation problems. Clifford PSWFs is new in literature and has some consequences that are now under investigation. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

15.
1. IntroductionSince Radon obtained the inverse formula of Radon transform in 1917, different inversemethods such as Fourier inversion, convolution back-projection inversion etc. have beeninvestigated['l']. Wavelet as a useful tool is interested in the inversion of Radon transformin recent years['--']. The application of wavelet analysis to Radon transform was proposedin I4] and [5]. An inversion formula based on continuous wavelet transform was derivedin [6] and [7]. This formula was based…  相似文献   

16.
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.  相似文献   

17.
Theory of Weierstrass transform is exploited to derive many interesting new properties of the Mexican hat wavelet transform. A real inversion formula in the differential operator form for the Mexican hat wavelet transform is established. Mexican hat wavelet transform of distributions is defined and its properties are studied. An approximation property of the distributional wavelet transform is investigated which is supported by a nice example.  相似文献   

18.
Convolution theorem for Poisson transform on compactly supported distributions is obtained. Applying the convolution theorem, Poisson transform is extended as a linear continuous map from a suitable Boehmian space into another Boehmian space satisfying the convolution theorem.  相似文献   

19.
In this paper, we define the Hankel–Wigner transform in Clifford analysis and therefore define the corresponding Weyl transform. We present some properties of this kind of Hankel–Wigner transform, and then give the criteria of the boundedness of the Weyl transform and compactness on the Lp space. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

20.
A discrete transform with a Bessel function kernel is defined, as a finite sum, over the zeros of the Bessel function. The approximate inverse of this transform is derived as another finite sum. This development is in parallel to that of the discrete Fourier transform (DFT) which lead to the fast Fourier transform (FFT) algorithm. The discrete Hankel transform with kernel Jo, the Bessel function of the first kind of order zero, will be used as an illustration for deriving the discrete Hankel transform, its inverse and a number of its basic properties. This includes the convolution product which is necessary for solving boundary problems. Other applications include evaluating Hankel transforms, Bessel series and replacing higher dimension Fourier transforms, with circular symmetry, by a single Hankel transform  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号