A Uni ed Systolic Array for Fast Computation of the DCT/DST/DHT

نویسندگان

  • Sung Bum Pan
  • Rae-Hong Park
چکیده

This paper proposes a two-dimensional (2-D) VLSI architecture using a uni ed systolic array for fast computation of the discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). The N -point discrete transform is decomposed into evenand oddnumbered frequency samples and they are computed independently at the same time. The proposed uni ed systolic array architecture can compute the DCT, DST, and DHT by de ning di erent coe cient values speci c for each transform. Also, we present another architecture for computation of the DHT, a modi ed version of the uni ed systolic array structure, which is faster than the uni ed architecture by a factor of two. In addition, the proposed uni ed architecture can be employed for computation of the inverse DCT/inverse DST/inverse DHT (IDCT/IDST/IDHT) with some modi cations. Subject terms: DCT; DST; DHT; uni ed systolic array.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unified systolic arrays for computation of the DCT/DST/DHT

|In this paper, we propose uni ed systolic arrays for computation of the 1-D and 2-D discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). By decomposing the transforms into evenand odd-numbered frequency samples, the proposed architecture computes the 1-D DCT/DST/DHT. Compared to the conventional methods the proposed systolic arrays exhibit advantages in t...

متن کامل

A VLSI array architecture for realization of DFT, DHT, DCT and DST

An unified array architecture is described for computation of DFT, DHT, DCT and DST using a modified CORDIC (CoOrdinate Rotation DIgital Computer) arithmetic unit as the basic Processing Element (PE). All these four transforms can be computed by simple rearrangement of input samples. Compared to five other existing architectures, this one has the advantage in speed in terms of latency and throu...

متن کامل

A NEW SYSTOLIC ARCHITECTURE FOR FAST DCT COMPUTATION - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium

This paper presents a fast algorithm along with its systolic array implementation for computing the 1-D Npoint discrete cosine transform (DCT), where N is a power of two. The architecture requires log,N multipliers and can evaluate one complete N-point DCT every N clock cycles. It possesses the features of regularity and modularity, and is thus well suited to VLSI implementation. As compared to...

متن کامل

Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms

The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms are considered. In particular, a new scheme employing the time-recursive approach to compute these transforms is presented. Using such approach, unified parallel lattice structures that can dually generate the DCT an...

متن کامل

Efficient systolic solution for a new prime factor discrete Hartley transform algorithm - Circuits, Devices and Systems, IEE Proceedings G

Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998