Discrete convolution with modulo operations

DOI10.1016/0893-9659(91)90135-IzbMath0764.65090MaRDI QIDQ1180314

Ricardo Ferré

Publication date: 27 June 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmsFourier transformconvolutiondiscrete Fourier transformnumber theoretic transformspseudo Fermat and pseudo Mersenne numberstensor rings

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebra for computer science
• Gaussian elimination is not optimal
• Fast multiplication of large numbers
• Digital Filtering Using Complex Mersenne Transforms
• On Computing the Discrete Fourier Transform
• Linear Filtering Technique for Computing Mersenne and Fermat Number Transforms
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Discrete convolution with modulo operations