Using quadratic residue arithmetic for computing skew cyclic convolutions

DOI10.1049/EL:19911325MaRDI QIDQ3986787zbMATH OpenOpenAlexFDO

Authors Alexander Skavantzos

Publication date 27 June 1992

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19911325

zbMATH Keywords

quadratic residue number systemsignal processingskew cyclic convolutions

Mathematics Subject Classification ID

Polynomials and rational functions of one complex variable (30C10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Parallel numerical computation (65Y05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Convolution quadrature revisited
• Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
• scientific article; zbMATH DE number 1559520
• Fast and Oblivious Convolution Quadrature
• Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system
• Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system
• Algorithms and Computation
• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms
• Improved fast polynomial transform algorithm for cyclic convolutions
• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers

This page was built for publication: Using quadratic residue arithmetic for computing skew cyclic convolutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986787)