Abstract
Abstract Due to their increasing application in digital signal processing and numerical analysis many fast algorithms for the discrete cosine transform (DCT) have been developed. Nevertheless, direct fast algorithms do not exist for DCTs of length N = p t if p > 2. This paper presents novel fast algorithms for DCTs of different single- and mixed-radix lengths by using a polynomial approach to the DCT which is mainly based on properties of Chebyshev polynomials.
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.
