An Efficient Approach For Realization Of Discrete Sine Transform And Its Inverse

摘要

In this paper, novel very-large-scale integration (VLSI) algorithms for computing the Discrete Sine Transform (DST) and its inverse (IDST) are proposed. By respectively folding the inputs, the DST kernels are derived to realize it through Infinite-impulse response (MR) structure. Single folding algorithm provides data throughput two times of that achieved by the conventional methods. The double folding recursive algorithms for DST and IDST have been suggested, which reduce the computation cycles to one forth of that in the single folding method. Moreover, the regular and modular properties of the proposed recursive structures are easily amenable to VLSI implementation.