Abstract
A recursive algorithm and its first order realization to compute DST (Discrete Sine transform) is presented in this paper. This algorithm is applicable for N = 2r where N is the length of input sequence. In this algorithm, DST coefficients are classified in p groups which are computed by N/2(p+1) length of DST formulation. Input is preprocessed by preprocessing block prior to application of DST formulation. Efficiency of presented structure is measured in terms of processing time and hardware requirement. Proposed algorithm requires N/2(p+1) execution cycles to compute a DST coefficient. Furthermore, proposed structure is suitable for VLSI implementation.