Open AccessVLSI Implementation of Discrete Cosine Transform Approximation Recursive Algorithm
Author(s) -
M. Deivakani,
S. V. Sudheer Kumar,
Naluguru Udaya Kumar,
E. Fantin Irudaya Raj,
V. Ramakrishna
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1817/1/012017
Subject(s) - discrete cosine transform , algorithm , mathematics , modified discrete cosine transform , discrete sine transform , computational complexity theory , transform coding , computer science , artificial intelligence , fourier transform , mathematical analysis , short time fourier transform , fourier analysis , image (mathematics)
In general, the approximation of Discrete Cosine Transform (DCT) is used to decrease computational complexity without impacting its efficiency in coding. Many of the latest algorithms used in DCT approximation functions have only a smaller DCT length transform of which some are non-orthogonal. For computing DCT orthogonal approximation, a general recursive algorithm is used here, and its length is obtained using DCT pairs of length N/2 of N addition cost in input pre-processing. The recursive sparse matrix has been decomposed by using the vector symmetry from the DCT basis in order to achieve the proposed approximation algorithm that is highly scalable to enforce the highest lengths software and hardware by using a current 8-point approximation to obtain a DCT approximation with two-length power, N>8.