Efficient computation of the DFT with only a subset of input or output points
From MaRDI portal
Publication:4038986
DOI10.1109/78.205723zbMath0775.65019OpenAlexW2090690379MaRDI QIDQ4038986
C. Sidney Burrus, Henrik V. Sorensen
Publication date: 8 August 1993
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/78.205723
Related Items
A tractable prescription for large-scale free flight expansion of wavefunctions ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ Optimising linear key recovery attacks with affine Walsh transform pruning ⋮ Real-time FFT algorithm applied to on-line spectral analysis ⋮ Fast transforms over finite fields of characteristic two ⋮ A generalized approach to linear transform approximations with applications to the discrete cosine transform ⋮ Randomized algorithms for the low-rank approximation of matrices ⋮ A fast randomized algorithm for the approximation of matrices ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ Accelerations of Zhao's methods for the numerical inversion of Laplace transform ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
