By Topic

On computing 2-D systolic algorithm for discrete cosine transform

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
$33 $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)
M. H. Lee ; Dept. of Inf. & Telecommun. Eng., Chonbuk Nat. Univ., Chonju, South Korea

A 2-D systolic array algorithm for the discrete cosine transform (DCT) is presented. It is based on the inverse discrete Fourier transform (DFT) version of the Goertzel algorithm via Horner's rule. This array requires N cells and multipliers, takes √N +2 clock cycles to produce a complete N-point DCT, and is able to process a continuous stream of data sequences

Published in:

IEEE Transactions on Circuits and Systems  (Volume:37 ,  Issue: 10 )