Abstract
Local adaptive signal processing can be carried out using the short-time discrete cosine transform (DCT). Two fast recursive algorithms for computing the short-time DCT are presented. The algorithms are based on a recursive relationship between three subsequent local DCT spectra. The computational complexity of the algorithms is compared with that of fast DCT algorithms.
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.
