Titlebook: Algorithms for Discrete Fourier Transform and Convolution; Richard Tolimieri,Chao Lu,Myoung An Book 1997Latest edition Springer-Verlag New

微枝末節(jié)

canonical

https://doi.org/10.1007/978-3-662-06552-5iate composite size cases. The method is completely algebraic and results in composite size algorithms whose factors contain tensor products of prime size factors. However, these results are not totally appealing since complex permutations appear. A related problem is that tensor products are taken over direct sum factors.

PANIC

Dendritic-Cells

RAFF

tenuous

維持

Linear and Cyclic Convolutions,onvolution by an FT of the corresponding size. In the last ten years, theoretically better convolution algorithms have been developed. The Winograd Small Convolution algorithm [1] is the most efficient as measured by the number of multiplications.

Dictation

有毒

MFTA: The Prime Case,n theorem that returns the computation to an FT computation. Since the size (p-1) is a composite number, the (p-1)-point FT can be implemented by Cooley-Tukey FFT algorithms. The Winograd algorithm for small convolutions also can be applied to the skew-circulant action. (See problems 3, 4 and 5 for basic properties of skew-circulant matrices.)

諄諄教誨

MFTA: Product of Two Distinct Primes,iate composite size cases. The method is completely algebraic and results in composite size algorithms whose factors contain tensor products of prime size factors. However, these results are not totally appealing since complex permutations appear. A related problem is that tensor products are taken over direct sum factors.