A simple fast jacket transform for DFT based on generalized prime factor decomposing algorithm

摘要

The simple factorization and construction algorithms for M-dimensional Jacket matrices are proposed on the basis of fast DFT transforms underlying generalized CRT index mappings. Based on the successively coprime order DFT matrices with respect to Chinese remainder theorem (CRT), the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices.