RECURSIVE FAST ALGORITHMS AND THE ROLE OF THE TENSOR PRODUCT

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.