Abstract
This chapter presents various approaches to the computation of the one-dimensional discrete cosine transform (DCT) -II. These are loosely classified as DCT via FFT, sparse matrix factorization, DIT and DIF algorithms, DCT via other transforms, and others. Although the approaches and the resulting algorithms are quite different, the prime purpose of achieving speed and accuracy is the common goal. It is not easy to select, out of this myriad of methods, one that may be considered superior to all others. Aside from the simple consideration of the numbers of multiplications and additions (complex or real), the structure of the flow graph, the mapping of input-to-output indices, and the recursively are important but as yet non quantifiable criteria that must somehow be taken into account. The one-dimensional DCT algorithms developed can be utilized for implementing multidimensional DCT, since it is a separable transform. Other algorithms for direct implementation of the multidimensional DCT have also been developed.
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.
