Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

DOI10.1007/BF01183180zbMath0885.68069MaRDI QIDQ677546

Juan-Miguel Gracia

Publication date: 26 May 1997

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

convolution of data sequences one-dimensional convolution; two-dimensional convolution

Mathematics Subject Classification ID

68W10: Parallel algorithms in computer science

13P05: Polynomials, factorization in commutative rings

Related Items

The AICE-CRT and digital signal processing algorithms: The complex case, On the factorization of polynomials and direct sum properties in integer polynomial rings

Cites Work

• The AICE-CRT and digital signal processing algorithms: The complex case
• On the factorization of polynomials and direct sum properties in integer polynomial rings
• Convolution using a conjugate symmetry property for the generalized discrete Fourier transform
• The generalized discrete Fourier transform in rings of algebraic integers
• Discrete transforms over polynomial rings with applications in computing multidimensional convolutions
• Number theoretic transforms for the calculation of convolutions
• Convolution using a conjugate symmetry property for number theoretic transforms over rings of regular integers
• Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings
• A fast computation of complex convolution using a hybrid transform
• Digital filtering using pseudo fermat number transforms
• The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution
• Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
• Rings, fields, the Chinese remainder theorem and an extension-Part II: applications to digital signal processing
• Discrete Convolutions via Mersenne Transforms