Realization of Prime-Length Discrete Sine Transform Using Cyclic Convolution
M. N. Murty · 2013
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 pipelined implementation of the DST. This algorithm preserves all the benefits of very large-scale integration algorithms based on cyclic convolution or circular convolution, such as regular and simple structure. The convolutions play a significant role in digital signal processing due to their nature of easy implementation.