%0 Journal Article
%T Regressive Structures for Computation of DST-II and Its Inverse
%A Priyanka Jain
%A Anamika Jain
%J ISRN Electronics
%D 2012
%R 10.5402/2012/537469
%X Efficient regressive structures for implementation of forward (DST-II) and inverse discrete sine transform (IDST-II) are developed. The proposed algorithm not only minimizes the arithmetic complexity compared to the existing algorithms (Wany (1990), Hupta and Rao (1990), Yip and Rao (1987), Murthy and Swamy (1992)) but also provides hardware savings over the algorithm (Jain et al. (2008)) by the same authors. The naturally ordered input sequence makes the new algorithms suitable for on-line computation. 1. Introduction Discrete sine transform (DST) and discrete cosine transform (DCT) are used as key functions in many signal and image processing applications, for example, block filtering, transform domain adaptive filtering, digital signal interpolation, adaptive beam forming, image resizing, speech enhancement [1¨C6] and so forth, due to their near optimal transform coding performance. Both DST and DCT are good approximations to the statistically optimal Karhunen-Loeve transform [7, 8]. It is found that in case of image with high correlation coefficient, DCT-based coding results in better performance but for low correlation image, DST gives lower bit rate [8]. Since both DCT and DST are computationally intensive, many efficient algorithms have been proposed to improve the performance of their implementation [9¨C12]; however most of these are only good software solutions. Chiang and Liu [13] suggested a regressive structure for DCT-IV and DST-IV using second order digital filters. This paper is aimed at developing a similar regressive filter structure for DST-II/IDST-II that provides considerable hardware saving compared to the existing algorithm [14] and also reduces the computation complexity in terms of number of operation (multiplication and addition) as compared to the existing algorithms [15¨C18]. The advantage of this implementation is that no permutation is required for the input/output sequences, and therefore it is especially suitable for on-line computation. 2. Regressive Formulas of DST-II/IDST-II and Realization through Filter Structure The DST of a sequence and its inverse are given by [14] where and Replacing by in (1a), by in (2), and after some algebraic manipulations, we obtain DST-II/IDST-II in the form Let ; and . Further we define We may rewrite (3) in the form Further, we can write as or Equation (9) can be represented by a sinusoidal recursive formula as In the same manner, we derive the sinusoidal formula for (5) as In (6) and (7), we define Using the sinusoidal recursive formula given in (10) and the fact that, ; and , (12) can be
%U http://www.hindawi.com/journals/isrn.electronics/2012/537469/