CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Filtering in Time-Frequency Domain using STFrFT

by Pragati Rana, Vaibhav Mishra, Rahul Pachauri
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 69 - Number 26
Year of Publication: 2013
Authors: Pragati Rana, Vaibhav Mishra, Rahul Pachauri
10.5120/12133-8391

Pragati Rana, Vaibhav Mishra, Rahul Pachauri . Filtering in Time-Frequency Domain using STFrFT. International Journal of Computer Applications. 69, 26 ( May 2013), 5-9. DOI=10.5120/12133-8391

@article{ 10.5120/12133-8391,
author = { Pragati Rana, Vaibhav Mishra, Rahul Pachauri },
title = { Filtering in Time-Frequency Domain using STFrFT },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 69 },
number = { 26 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume69/number26/12133-8391/ },
doi = { 10.5120/12133-8391 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:31:20.392948+05:30
%A Pragati Rana
%A Vaibhav Mishra
%A Rahul Pachauri
%T Filtering in Time-Frequency Domain using STFrFT
%J International Journal of Computer Applications
%@ 0975-8887
%V 69
%N 26
%P 5-9
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Fractional Fourier Transform is a generalized form of Fourier Transform, which can be interpreted as a rotation by angle ? in time-frequency plane or decomposition of signals in terms of chirps. However it fails in locating Fractional Fourier Domain Frequency contents. Short-time FRFT variants are suitable for analysis of multicomponent and non-linear chirp signals with improved time-frequency resolution. Short-Time FRFT is the simultaneous representation of, combination of the time and FRFD-frequency information. Filtering in the fractional domain separates the noise and the highly concentrated signal. Filtering results depict that the results in fractional domain give better results. The time-frequency representation in fractional domain is useful tool for various applications like filtering of chirp signals. Simulations are performed on MATLAB platform.

References
  1. C. Capus and K. Brown, "Short-time fractional Fourier methods for the time-frequency representation of chirp signals," J. Acoust. Soc. Amer. ,vol. 113, no. 6, pp. 3253–3263, Jun. 2003.
  2. L. Cohen. Time-frequency analysis [J]. IEEE Signal Processing, 1999, vol. 16,pp:22-28, January1987.
  3. J. B. Wu, J. Chen, P. Zhong. Time frequency-based blind source separation technique for elimination of cross-terms in Wigner distribution [J]. Electronics Letters, vol. 39, pp:475-477, May 2003.
  4. L. B. Almeida, "The fractional Fourier transform and time-frequency representations," IEEE Trans. Signal Process. , vol. 42, no. 11, pp. 3084–3091, Nov. 1994.
  5. X. G. Xia, "On bandlimited signals with fractional Fourier transform," IEEE Signal Process. Lett. , vol. 3, pp. 72–74, Mar. 1996.
  6. R. Tao, B. Deng, W. Q. Zhang, and Y. Wang, "Sampling and sampling rate conversion of band limited signals in the fractional Fourier transform domain," IEEE Trans. Signal Process. , vol. 56, no. 1, pp. 158–171, Jan. 2008.
  7. Ran Tao, Yan –Lei Li and Yue Wang, "Short Time Fractional Fourier Transform and its Applications", IEEE Trans. Signal Process. , vol. 58, no. 05,pp 2568-2580, May 2010.
  8. H. M. Ozaktas and OO. Aytur, "Fractional Fourier domains", Signal Process. , vol. 46, pp. 119-124, 1995.
Index Terms

Computer Science
Information Sciences

Keywords

Tfd Stft Wvd Stfrft Frft

Powered by PhDFocusTM