论文部分内容阅读
计算复杂度太高极大地限制了“旋转算术”在数字信号处理领域中的应用，该文提出了快速实现Ｇｉｖｅｎｓ旋转运算的方法，与传统的Ｃｏｒｄｉｃ算法相比较，使“移位—加”运算的次数大大减少，从而为用“旋转算术”代替传统的“乘加算术”创造了条件。进一步给出了各种快速旋转运算的超大规模集成电路（ＶＬＳＩ）硬件结构，在此基础上发展出一种能够实现任意角度旋转的四级流水线快速旋转器，它可以在一类新型的使用Ｇｉｖｅｎｓ旋转序列实现各种正交变换的处理器中做为核心运算单元，使得其计算复杂度与传统的“乘加算术”可比。
The computational complexity is too high, which greatly limits the application of “rotation arithmetic” in the field of digital signal processing. In this paper, a fast implementation of Givens rotation algorithm is proposed. Compared with the traditional Cordic algorithm, the “shift-plus” Greatly reduced the number of times, thus creating the conditions for the use of “rotating arithmetic” instead of the traditional “multiply-add arithmetic.” Furthermore, the VLSI hardware structures of various fast rotation operations are given. Based on this, a four-stage pipeline fast rotation device capable of rotating at any angle is developed, which can be used in a new type of system using Givens Rotation sequence to achieve a variety of orthogonal transform processor as the core computing unit, making its computational complexity and the traditional “multiply-add arithmetic” comparable.