摘要：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.
