FFT-based convolution can skip index-reversal permutations because the three sets cancel in the Cooley-Tukey composition, with benchmarks for multi-dimensional general-radix cases against standard implementations.
AFIPS ’68 (Fall, part I): Proceedings of the December 9-11, 1968, fall joint computer conference, part I (1968), 115–125
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Permutation-Avoiding FFT-Based Convolution
FFT-based convolution can skip index-reversal permutations because the three sets cancel in the Cooley-Tukey composition, with benchmarks for multi-dimensional general-radix cases against standard implementations.