Generalized Parseval’s Theorem on Fractional Fourier Transform for Discrete Signals and Filtering of LFM Signals

HTML  Download Download as PDF (Size: 595KB)  PP. 274-281  
DOI: 10.4236/jsip.2013.43035    4,943 Downloads   8,179 Views  Citations

ABSTRACT

This paper investigates the generalized Parseval’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Parseval’s theorem reduces to an inequality with lower and upper bounds associated with FRFT parameters, named as generalized Parseval’s theorem by us. These results theoretically provide potential valuable applications in filtering, and examples of filtering for LFM signals in FRFT domains are demonstrated to support the derived conclusions.

Share and Cite:

X. Wang, G. Xu, Y. Ma, L. Zhou and L. Wang, "Generalized Parseval’s Theorem on Fractional Fourier Transform for Discrete Signals and Filtering of LFM Signals," Journal of Signal and Information Processing, Vol. 4 No. 3, 2013, pp. 274-281. doi: 10.4236/jsip.2013.43035.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.