A novel generic fast Fourier transform pruning technique and complexity analysis
From MaRDI portal
Publication:5355621
DOI10.1109/TSP.2004.838925zbMath1372.65363MaRDI QIDQ5355621
Publication date: 20 September 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Analysis of algorithms (68W40) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)
Related Items (4)
Optimising linear key recovery attacks with affine Walsh transform pruning ⋮ A generalized approach to linear transform approximations with applications to the discrete cosine transform ⋮ Accelerations of Zhao's methods for the numerical inversion of Laplace transform ⋮ Improving key-recovery in linear attacks: application to 28-round PRESENT
This page was built for publication: A novel generic fast Fourier transform pruning technique and complexity analysis
