Fractional wavelet transform is a generalization of the classical wavelet transform. This transform is proposed in order to rectify the limitations of the WT and the fractional Fourier transform. The FRWT inherits the advantages of multiresolution analysis of the WT and has the capability of signal representations in the fractional domain which is similar to the FRFT.
Definition
The fractional Fourier transform ，a generalization of the Fourier transform, serves a useful and powerful analyzing tool in optics, communications, signal and image processing, etc. This transform, however, has one major drawback due to using global kernel, i.e., the fractional Fourier representation only provides such FRFT spectral content with no indication about the time localization of the FRFT spectral components. Therefore, the analysis of non-stationary signals whose FRFT spectral characteristics change with time requires joint signal representations in both time and FRFT domains, rather than just a FRFT-domain representation. The first modification to the FRFT to allow analysis of aforementioned non-stationary signals came as the short-time FRFT. The idea behind the STFRFT was segmenting the signal by using a time-localized window, and performing FRFT spectral analysis for each segment. Since the FRFT was computed for every windowed segment of the signal, the STFRFT was able to provide a true joint signal representation in both time and FRFT domains. However, the drawback is that the STFRFT has the limitation of a fixed window width which needs to be fixed a priori; this effectively means that it does not provide the requisite good resolution in both time and FRFT domains. In other words, the efficiency of the STFRFT techniques is limited by the fundamental uncertainty principle, which implies that narrow windows produce good time resolution but poor spectral resolution, whereas wide windows provide good spectral resolution but poor time resolution. Most of the signals of practical interest are such that they have high spectral components for short durations and low spectral components for long durations. As a generalization of the wavelet transform, Mendlovic and David first introduced the fractional wavelet transform as a way to deal with optical signals, which was defined as a cascade of the FRFT and the ordinary wavelet transform, i.e., where the transform kernel is given by where, and denotes the FRFT of. But it could not be regarded as a kind of joint time-FRFT-domain representation since time information is lost in this transform. Moreover, Prasad and Mahato expressed the ordinary WT of a signal in terms of the FRFTs of the signal and mother wavelet, and also called the expression the FRWT. That is, where and denote the FTs and, respectively. Clearly, this so-called FRWT is identical to the ordinary WT. Recently, Shi et al. proposed a new definition of the FRWT by introducing a new structure of the fractional convolution associated with the FRFT. Specifically, the FRWT of any function is defined as where is a continuousaffine transformation and chirp modulation of the mother wavelet, i.e., in which and are scaling and translation parameters, respectively. Conversely, the inverse FRWT is given by where is a constant that depends on the wavelet used. The success of the reconstruction depends on this constant called, the admissibility constant, to satisfy the following admissibility condition: where denotes the FT of. The admissibility condition implies that, which is. Consequently, continuous fractional wavelets must oscillate and behave as bandpass filters in the fractional Fourier domain. From this viewpoint, the FRWT of can be expressed in terms of the FRFT-domain representation as where indicates the FRFT of, and denotes the FT of. Note that when, the FRWT reduces to the classical WT. For more details of this type of the FRWT, see and.
