RECURSIVE FAST ALGORITHMS AND THE ROLE OF THE TENSOR PRODUCT

被引：47

作者：

GRANATA, J

CONNER, M

TOLIMIERI, R

机构：

[1] Center for Large Scale Computation, the City University of New York, New York

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 1992年 / 40卷 / 12期

关键词：

D O I：

10.1109/78.175736

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The tensor product has proven to been a powerful linguistic tool for modeling and designing FFT algorithms. The benefit of the tensor product approach lies in the strong connection between certain tensor product constructs and important computer architectures. In this paper the scope of the tensor product approach is generalized to include a much larger class of fast recursive algorithms. This greatly enhances the versatility of the tensor product technique and also brings many different algorithms to the level of understanding and flexibility enjoyed by the FFT.

引用

页码：2921 / 2930

页数：10