Abstract
The general-purpose, non-recursive algorithm to compute the STDFT is based on a radix-2 decimation-in-time scheme. In this work a new algorithm, based on a modified radix-2 decimation-in-frequency scheme, is presented for the efficient computation of the fixed-time-origin STDFT. The proposed method is compared with the existing competing algorithm in terms of computational cost.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
