A New Vlsi Architecture for 2-d Dst Transform of Prime Length
نویسندگان
چکیده
Using a recently proposed VLSI algorithm for 2-D discrete sine transform (DST) an efficient VLSI architecture is proposed. This VLSI architecture has a modular and regular hardware structure and can compute in parallel thus resulting in high speed performances. The proposed architecture has been obtained by mapping the VLSI algorithm into two linear systolic arrays and combining them into a single linear systolic array having a high computing speed and low I/O cost with a small number of I/O channels placed at the two ends of the linear array. The presented architecture has all the advantages of the systolic array paradigm, like regular and modular structure with an interconnection topology appropriated for the VLSI technology.
منابع مشابه
A Vlsi Algorithm for the Hardware Implementation of 1-d Discrete Sine Transform Based on a Pseudo-band Correlation Structure
Abstract. Using a novel input restructuring sequence and appropriate index-mapping techniques a new VLSI algorithm for a prime-length DST is presented. The proposed algorithm uses a modular and regular computational structure, called pseudo-band correlation structure, well adapted to the VLSI implementation of 1-D DST, thus resulting an efficient VLSI implementation. The proposed algorithm can ...
متن کاملRealization of Prime-Length Discrete Sine Transform Using Cyclic Convolution
This paper presents a new algorithm for the implementation of an N-point prime-length discrete sine transform (DST) through cyclic convolution. The proposed algorithm is based on the idea of reformulating prime N-length DST into two 1 /2 point cyclic convolutions. Thus, the hardware complexity can be reduced. This cyclic convolution –based algorithm is used to obtain a simple systolic array for...
متن کامل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 Uni ed Systolic Array for Fast Computation of the DCT/DST/DHT
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 archite...
متن کاملRecursive Algorithms for Realization of One- Dimensional Discrete Sine Transform and Inverse Discrete Sine Transform
In this paper, novel recursive algorithms for realization of one-dimensional discrete sine transform (DST) and inverse discrete sine transform (IDST) of any length are proposed. By using some mathematical techniques, recursive expressions for DST and IDST have been developed. Then, the DST and IDST are implemented by recursive filter structures. A linear systolic architecture for realization of...
متن کامل