VLSI architecture for fast rotators
Zhiqiang Zeng · Journal of Tsinghua University(Science and Technology) · 1999
High computing complexity greatly limits application of “rotation arithmetic” in digital signal processing. The methods for the fast realization of Givens rotation are presented. Compared with the traditional Cordic algorithm, they greatly decrease the number of “shift addition” so that it makes “rotation arithmetic” realistic to replace “multiplication addition arithmetic”. The very large scale integration (VLSI) architectures of various fast rotations are also given. Based on them, a four stage pipeline fast rotator is developed to realize the rotation of the arbitrary angle. It can be used as the core for the new VLSI DSP to perform various orthogonal transform by Givens rotation sequences. Its computing complexity can be comparable with the traditional “multipication addition arithmetic”.