全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Efficient Time-Frequency Localization of a Signal

DOI: 10.1155/2014/529852

Full-Text   Cite this paper   Add to My Lib

Abstract:

A new representation of the Fourier transform in terms of time and scale localization is discussed that uses a newly coined A-wavelet transform (Grigoryan 2005). The A-wavelet transform uses cosine- and sine-wavelet type functions, which employ, respectively, cosine and sine signals of length . For a given frequency , the cosine- and sine-wavelet type functions are evaluated at time points separated by on the time-axis. This is a two-parameter representation of a signal in terms of time and scale (frequency), and can find out frequency contents present in the signal at any time point using less computation. In this paper, we extend this work to provide further signal information in a better way and name it as -wavelet transform. In our proposed work, we use cosine and sine signals defined over the time intervals, each of length , , and are nonnegative integers, to develop cosine- and sine-type wavelets. Using smaller time intervals provides sharper frequency localization in the time-frequency plane as the frequency is inversely proportional to the time. It further reduces the computation for evaluating the Fourier transform at a given frequency. The A-wavelet transform can be derived as a special case of the -wavelet transform. 1. Introduction There are two domains for representing a signal: time and frequency domains. Depending upon the information required, either representation can be used. Fourier analysis has been the main technique for transforming a signal from one representation into another. In spite of the fact that the Fourier analysis is an ideal solution for deterministic and stationary signals, it is hardly of any use for time-varying signals or nonstationary signals, because analysis of these types of signals compromises between their transition and long term behaviors. For these types of signals, a transform is desired to represent the signal in a two-parameter form. The very first such transform in literature is the short time Fourier transform (STFT) [1]. This transform uses a time-window function to decompose the signal into segments and then the Fourier analysis is carried out on individual segments. The STFT provides local features that are present in the signal in a limited form because it uses the time-window function of fixed width for all frequency contents and thus it is unable to extract the required information in any given signal. So, a transform that can represent the signal in two-parameter form and uses the time-window function of different lengths is needed. Application of the short time Fourier transform multiple times

References

[1]  D. Gabor, “Theory of communication,” Journal of IEE, vol. 93, pp. 429–457, 1946.
[2]  T. Edward, Discrete Wavelet Transforms: Theory and Implementation Stanford, Stanford University, Palo Alto, Calif, USA, 1991.
[3]  A. K. Louis, D. Maass, and A. Rieder, Wavelets: Theory and Applications, John Wiley & Sons, New York, NY, USA, 1997.
[4]  C. S. Burrus, R. A. Gopinath, and H. Guo, Introduction to Wavelets and Wavelet Transforms: A Primer, Prentice-Hall, Upper Saddle River, NJ, USA, 1998.
[5]  J. C. Goswami and A. K. Chan, Fundamentals of Wavelets: Theory, Algorithms, and Applications, John Wiley & Sons, New York, NY, USA, 1999.
[6]  Y. Meyer, Wavelets: Algorithms and Applications, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 1993.
[7]  I. Daubechies, Ten Lectures on Wavelets, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 1992.
[8]  S. Mallat, A Wavelet Tour of Signal Processing, Academic Press, San Diego, Calif, USA, 2nd edition, 1998.
[9]  M. Vetterli and C. Herley, “Wavelets and filter banks: Theory and design,” IEEE Transactions on Signal Processing, vol. 40, no. 9, pp. 2207–2232, 1992.
[10]  G. Strang, “Wavelets and dilation equations: a brief introduction,” SIAM Review, vol. 31, no. 4, pp. 614–627, 1989.
[11]  O. Rioul and M. Vetterli, “Wavelets and signal processing,” IEEE Signal Processing Magazine, vol. 8, no. 4, pp. 14–38, 1991.
[12]  I. W. Selesnick, “A higher density discrete wavelet transform,” IEEE Transactions on Signal Processing, vol. 54, no. 8, pp. 3039–3048, 2006.
[13]  C. K. Chui and W. He, “Compactly supported tight frames associated with refinable functions,” Applied and Computational Harmonic Analysis, vol. 8, no. 3, pp. 293–319, 2000.
[14]  A. M. Grigoryan, “Fourier transform representation by frequency-time wavelets,” IEEE Transactions on Signal Processing, vol. 53, no. 7, pp. 2489–2497, 2005.
[15]  A. M. Grigoryan and S. S. Agaian, Multidimensional Discrete Unitary Transforms: Representation, Partitioning and Algorithms, Marcel Dekker, New York, NY, USA, 2003.
[16]  S. Chand, “SC- and SS-wavelet transforms,” Signal Processing, vol. 89, no. 3, pp. 305–313, 2009.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413