A new systolic array algorithm for inverse discrete cosine transform with high throughput rate

In this paper a new approach for the realization of the inverse 1D discrete cosine transform (IDCT) is presented. This approach is based on a new formulation of an odd prime-length IDCT which uses two half-length cyclic convolutions with the same form which can be concurrently computed. Using this a...

Full description

Saved in:
Bibliographic Details
Main Author: Chiper, D.F.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Computational complexity
Concurrent computing
Convolution
Costs
Discrete cosine transforms
Hardware
Parallel processing
Systolic arrays
Throughput
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper a new approach for the realization of the inverse 1D discrete cosine transform (IDCT) is presented. This approach is based on a new formulation of an odd prime-length IDCT which uses two half-length cyclic convolutions with the same form which can be concurrently computed. Using this approach, a new efficient systolic array with a higher throughput rate, a reduced average computation time, and a very regular structure can be obtained as compared with other systolic arrays for IDCT based on using cyclic convolution forms. A simpler control structure and hardware structure of the PE's, and hence a reduced cycle time, can be obtained. It owns all the outstanding features of the other systolic arrays implementations based on using cyclic convolution forms, being very well suited for a VLSI realization.
DOI:10.1109/ISIE.1996.548419