CORDIC-based fast radix-2 DST algorithms

This paper proposes a novel coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of the discrete sine transforms (DST). The proposed algorithms can generate the next higher order transforms from lower order transforms and have some distinct advantages, such as regular and purely feed forward data path, in place computation, unique post-scaling factor and arithmetic-sequence CORDIC rotation angles. Compared to existing algorithms, these proposed algorithms not only have lower arithmetic complexity, but also admit efficient pipelined VLSI implementation. In addition, an easy way to obtain the fast inverse DST by using the orthogonal property is presented.