By Topic

A new systolic array algorithm for memory-based VLSI array implementation of DCT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chiper, D.F. ; Dept. of Appl. Electron., Tech. Univ. Gh. Asachi, Iasi, Romania

A new approach for a memory-based VLSI realization of the 1D discrete cosine transform (1D-DCT) that significantly improves the previous designs is presented. This approach is based on a new formulation of an odd prime-length DCT algorithm. It uses two half-length cyclic convolutions with the same form, which are such reformulated that multipliers can be efficiently replaced by small biport ROMs and computed in parallel. Using this approach, high structural regularity, low hardware cost of the PE's and average computation time, and low I/O cost can be obtained. So, the average computation time has been reduced to one half and the throughput has been doubled, when compared with that of Guo et al. (1992). Thus an efficient systolic array for DCT, which is well suited for VLSI realization, can be obtained. It possesses also a much lower control complexity, it simpler interconnection structure, and a simpler hardware structure of the PEs, having thus a shorter cycle time. Moreover, it owns all other outstanding features of the VLSI array proposed by Guo et al

Published in:

Computers and Communications, 1997. Proceedings., Second IEEE Symposium on

Date of Conference:

1-3 Jul 1997