作者: R. Tolimieri , Myoung An , Chao Lu
DOI: 10.1007/978-1-4757-3854-4_8
关键词:
摘要: The Cooley-Tukey FFT algorithm and its variants depend upon the existence of non-trivial divisors transform size N. These algorithms are called additive since they rely on subgroups group structure indexing set. A second approach to design FT depends multiplicative We appealed previously, in chapter 5, derivation Good-Thomas PFA.