Unified systolic array for fast computation of the discrete cosine transform, discrete sine transform, and discrete Hartley transform

1997 ◽  
Vol 36 (12) ◽  
pp. 3439 ◽  
Author(s):  
Sung Bum Pan
Keyword(s):  
Discrete Cosine Transform ◽  
Systolic Array ◽  
Fast Computation ◽  
Cosine Transform ◽  
Discrete Hartley Transform ◽  
Hartley Transform ◽  
Sine Transform

scholarly journals Algorithm for Computation of DCT and its Implementation using a Systolic Architecture

2020 ◽  
Vol 9 (4) ◽  
pp. 2162-2167
Keyword(s):  
Systolic Array ◽  
Cost Effective ◽  
The Other ◽  
Systolic Architecture ◽  
Discrete Hartley Transform ◽  
Processing Elements ◽  
Suggested Algorithm ◽  
Hartley Transform ◽  
Sine Transform ◽  
Regular Design

In this paper a new algorithm for computing N-point DCT, where N=4r, r>1 is presented. A new algorithm has been derived that can compute the 1D DCT and it is realized in systolic array that utilizes identical processing elements (PE’s). The proposed approach can be used to obtain other transform like Discrete Sine Transform (DST), Discrete Hartley Transform (DHT). The suggested algorithm requires reduced number of multiplications as compared to the other methods of computing DCT. This suggests structure meets the architectural challenge and it is simple, regular design and cost-effective for special-purpose system.

Systolic array for fast computation of discrete cosine transform

1998 ◽  
Author(s):  
Jianguo Liu ◽  
H. F. Li ◽  
Francis H. Y. Chan ◽  
F. K. Lam
Keyword(s):  
Discrete Cosine Transform ◽  
Systolic Array ◽  
Fast Computation ◽  
Cosine Transform

scholarly journals Improved Algorithm for ODCT Computation of a Running Data Sequence

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
S. Akhter ◽  
V. Karwal ◽  
R. C. Jain
Keyword(s):  
Real Time ◽  
Discrete Cosine Transform ◽  
Input Data ◽  
Time Sequence ◽  
Data Sequence ◽  
Cosine Transform ◽  
Rectangular Window ◽  
Sine Transform ◽  
Data Points ◽  
Transform Coefficients

Fast windowed update algorithms capable of independently updating the odd discrete cosine transform (ODCT) and odd discrete sine transform (ODST) of a running data sequence are analytically developed. In this algorithm, to compute the ODCT coefficients of a real-time sequence, we do not require the ODST coefficients. Similarly, the ODST coefficients of the shifted sequence can be calculated without using ODCT coefficients. The running input data sequence is sampled using a rectangular window. However, this idea can be easily extended for other windows. The update algorithm derived herein can be used to compute the transform coefficients of the shifted sequence as new data points are available. The complexity of developed algorithm isO(N). The validity of algorithm is tested by MATLAB simulations.

Sign in / Sign up

Export Citation Format

Share Document