Title
Simple systolic arrays for discrete cosine transform
Abstract
in this paper, simple 1-D and 2-D systolic array for realizing the discrete cosine transform (DCT) based on the discrete Fourier transform (DFT) fo an input sequence are presented. The proposed arrays are obtained by a simple modified DFT (MDFT) and an inverse DFT (IDFT) version of the Goertzel algorithm combined with Kung's approach. The 1-D array requiresN cells, one multiplier and takesN clock cycles to produce a completeN-point DCT. The 2-D array takes √N clock cycles, faster than the 1-D array, but the area complexity is larger. A continuous flow of input data is allowed and no idle time is required between the input sequences.
Year
DOI
Venue
1990
10.1007/BF01937368
Multidimensional Systems and Signal Processing
Keywords
Field
DocType
Fourier,Fourier Transform,Artificial Intelligence,Input Data,Continuous Flow
Non-uniform discrete Fourier transform,Discrete mathematics,Goertzel algorithm,Modified discrete cosine transform,Discrete cosine transform,Arithmetic,Discrete Fourier transform (general),Discrete Fourier transform,Discrete Hartley transform,Discrete sine transform,Mathematics
Journal
Volume
Issue
ISSN
1
4
0923-6082
Citations 
PageRank 
References 
3
0.60
3
Authors
3
Name
Order
Citations
PageRank
Moon Ho Lee1765107.66
Jong Oh Park241.01
Yasuhiko Yasuda311317.55