52 pages matching number of arithmetic in this book
Results 1-3 of 52
What people are saying - Write a review
We haven't found any reviews in the usual places.
Fast Convolution Algorithms
The Fast Fourier Transform
6 other sections not shown
additions per point aperiodic convolution arithmetic operations calculated Chinese remainder reconstruction Chinese remainder theorem circular convolution coefficients complex multiplications convolution of length correlation corresponding cyclotomic polynomials defined modulo DFTs computed DFTs of length digital filtering discrete Fourier transforms evaluated Fermat number FFT algorithm implemented input sequences integers inverse Mersenne number Mersenne transforms modulo P(z modulo q modulo zN multidimensional DFTs multiplications additions mutually prime nesting algorithm nesting method NiN2 nomial NTTs number of additions number of arithmetic number of multiplications number of operations Number of real odd prime permutation polynomial multiplication modulo polynomial product modulo POLYNOMIAL TRANSFORM MODULO prime factor algorithm primitive roots product modulo zN quadratic nonresidue quadratic residue Rader's algorithm real multiplications reduced DFTs REDUCTION MODULO relatively prime replaced root of order scalar Sect sequence xm small DFTs split nesting stage Table tions total number transforms of length twiddle factors two-dimensional convolution