Fast discrete cosine transform algorithm for systolic arrays

20 January 1983

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 19 (2) , 58-60
https://doi.org/10.1049/el:19830043

Abstract

A fast algorithm for an N-point discrete cosine transform (DCT) is derived from a 4N-point Winograd Fourier transform algorithm (WFTA). This algorithm, which has the same form as Winograd's Fourier transform and convolution algorithms, is suitable for a high-speed implementation using one-bit systolic arrays.

Keywords

SYSTOLIC ARRAYS
FAST DISCRETE COSINE TRANSFORM ALGORITHM
N-POINT DISCRETE COSINE TRANSFORM
4N-POINT WINOGRAD FOURIER TRANSFORM ALGORITHM

This publication has 0 references indexed in Scilit: