scientific article
From MaRDI portal
Publication:3258578
zbMath0086.12403MaRDI QIDQ3258578
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On Computing the Discrete Fourier Transform, Implementation of a self-sorting in-place prime factor FFT algorithm, A self-sorting in-place prime factor real/half-complex FFT algorithm, Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Improved recovery guarantees for phase retrieval from coded diffraction patterns, FFT bifurcation analysis of routes to chaos via quasiperiodic solutions, Integer multiplication in time \(O(n\log n)\), Fast decoding of non-binary first order Reed-Muller codes, Generalization of the fast Fourier transform with a constant structure, The secret life of I. J. Good, Triangular systems for symmetric binary variables, An algorithm for gene frequency changes for linked autosomal loci based on genetic algebras, Fully homomorphic SIMD operations, Points of constancy of the periodic linearized Korteweg–deVries equation, An Algorithm for the Machine Calculation of Complex Fourier Series, Roundoff Error Analysis of the Fast Fourier Transform, Fourier matrices and Fourier tensors, Construction of Binary Bent Functions by FFT-Like Permutation Algorithms, Faster polynomial multiplication over finite fields using cyclotomic coefficient rings, Rotator design, Redundancy techniques and fast algorithms for a special large linear system, Characteristic vector and weight distribution of a linear code, Efficient Computation of the Fourier Transform on Finite Groups, New Good's type Kronecker power expansions, Algebraic theory of finite Fourier transforms, Eigenspaces of the discrete Walsh transform, Discrete Chrestenson transform, Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations, Nesting strategies for prime factor FFT algorithms, Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme, Self-sorting mixed-radix fast Fourier transforms, A note on prime factor FFT algorithms, Gauss and the history of the fast Fourier transform, The differential Fourier transform method, Irregular primes to two billion
