Abstract
This paper presents a fast DCT algorithm by using convolution method. Multipliers will be a crucial process in designing a fast DCT algorithm because they take a long time to complete their process. Reducing a number of multipliers is the one way to make a fast DCT algorithm. This paper shows how to reduce multipliers by using two steps: the first step is by grouping transformation matrix to be two groups in which this process uses the folding concept. The second step is by using fast convolution by inspection to minimize multipliers. Keywords : multiplier, fast DCT, fast convolution, folding.
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.
