Abstract
Various convolutional approaches to computing the 1D and 2D discrete cosine transform (DCT) are presented. In the 1D case the method of W. Li (see IEEE Trans. Signal Process., vol.39, no.6, p.1305-13, 1991) is introduced, and a more regular structure than that of the Li method is described. Since both methods are complicated to implement with systolic arrays, a proper array structure is proposed. This structure speeds up the multiplication by processing with real numbers instead of complex numbers. The 2D algorithm and structure are obtained by expansion of the 1D algorithm. The resulting structure is faster than the 1D structure and requires fewer processing elements.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
