Abstract
This correspondence presents an odd-factor algorithm for the type-III discrete cosine transform (DCT) for uniform or mixed radix decomposition. By jointly using the old-factor and the existing radix-2 algorithms, a general decomposition method for arbitrarily composite sequence length is developed. A reduction of computational complexity can be achieved compared with that needed by other reported algorithms for M=2/sup m/. The decomposition approach has a simple computational structure and supports a wider range of choices for different sequence lengths.
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.
