VLSI Implementation of Discrete Cosine Transform Approximation Recursive Algorithm

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 c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1817; číslo 1; s. 12017
Hlavní autoři: Deivakani, M., Kumar, S.V. Sudheer, Kumar, Naluguru Udaya, Raj, E. Fantin Irudaya, Ramakrishna, V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.03.2021
Témata:
Algorithms
Approximation
Discrete cosine transform
Integrated circuits
Mathematical analysis
Matrix methods
Physics
Sparse matrices
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Conference Proceeding-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1817/1/012017