Optimal short-time Fourier transform for monocomponent signals
Proceedings of the 12th Signal Processing and Communications Applications Conference, IEEE 2004
312 - 315
Item Usage Stats
New methods of improving the short-time Fourier transform representation of signals have recently emerged. These methods use linear canonical transforms to bring the signal into a minimal time-bandwidth product form. Here we show that linear canonical transforms are not sufficient to achieve the minimum time-bandwidth product for high-order modulated mono-component signals. Therefore we propose a novel short-time Fourier transform method which requires an adaptive window, making use of an initial instantaneous frequency estimator. The new approach is able to achieve the highest possible resolution for monocomponent signals. Finally, we discuss the benefits of the proposed method.
Linear canonical transforms
Short-time Fourier transform
Published Version (Please cite this version)https://www.doi.org/10.1109/SIU.2004.1338322
Showing items related by title, author, creator and subject.
Sparse representation of two-and three-dimensional images with fractional fourier, hartley, linear canonical, and haar wavelet transforms Koç A.; Bartan, B.; Gundogdu, E.; Çukur, T.; Özaktaş, Haldun M. (Elsevier Ltd, 2017)Sparse recovery aims to reconstruct signals that are sparse in a linear transform domain from a heavily underdetermined set of measurements. The success of sparse recovery relies critically on the knowledge of transform ...
Özaktaş, Haldun M.; Öktem, F. S. (IEEE, 2014)We study the degrees of freedom of optical systems and signals based on space-frequency (phase-space) analysis. At the heart of this study is the relationship of the linear canonical transform domains to the space-frequency ...
Özaktaş, Haldun M.; Koç, A. (IEEE, 2015)Linear canonical transforms are encountered in many areas of science and engineering. Important transformations such as the fractional Fourier transform and the ordinary Fourier transform are special cases of this transform ...