Design and Digital Implementation of Fast and Recursive DCT II–IV Algorithms

Using the proposed factorizations of discrete cosine transform (DCT) matrices, fast and recursive algorithms are stated. In this paper, signal flow graphs for the n -point DCT II and DCT IV algorithms are introduced. The proposed algorithms yield exactly the same results as with standard DCT algorit...

Full description

Saved in:

Bibliographic Details
Published in:	Circuits, systems, and signal processing Vol. 38; no. 2; pp. 529 - 555
Main Authors:	M. Perera, Sirani, Madanayake, Arjuna, Dornback, Nathan, Udayanga, Nilan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2019 Springer Nature B.V
Subjects:	Algorithms Circuits and Systems CMOS Computation Computer architecture Computer simulation Discrete cosine transform Electrical Engineering Electronics and Microelectronics Engineering Field programmable gate arrays Flow graphs Instrumentation Integrated circuits Power consumption Signal flow graphs Signal,Image and Speech Processing Tradeoffs Sparse and orthogonal factors Recursive algorithms Application-specific integrated circuits (ASIC) Field-programmable gate array (FPGA) Fast algorithms Signal flow graphs Discrete cosine transforms Arithmetic complexity
ISSN:	0278-081X, 1531-5878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!