Abstract
Using sparse matrix factorization, algorithms for length 15 and 30 discrete cosine transforms (DCTs) are developed that require only a single cascaded multiplier in the center of the flow graph. Complete matrix factorizations required to compute the algorithms are presented and it is shown, by computational complexity comparisons, that these algorithms are more efficient than either the radix-2 algorithm or B.G. Lee's (1987) index mapping algorithm. These algorithms are more efficient than the commonly used radix-2 algorithms for the DCT, especially in terms of the number of required multiplications. They can be used as basic blocks to build algorithms for DCT of length 15*2/sup k/. >
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.
