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

DOI10.1007/BF01183180zbMATH Open0885.68069MaRDI QIDQ677546FDOQ677546

Authors: Juan-Miguel Gracia 

Publication date: 26 May 1997

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

Recommendations

• On algorithms for digital signal processing of sequences
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings
• scientific article; zbMATH DE number 4032920

zbMATH Keywords

convolution of data sequences one-dimensional convolutiontwo-dimensional convolution

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Polynomials, factorization in commutative rings (13P05)

Cites Work

• The generalized discrete Fourier transform in rings of algebraic integers
• 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
• 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

Cited In (14)

• A fast algorithm for exact convolution of rational sequences by using integer arithmetics only
• The AICE-CRT and digital signal processing algorithms: The complex case
• Convolution algorithms, based on the CRT (Chinese remainder theorem).
• On the factorization of polynomials and direct sum properties in integer polynomial rings
• Title not available (Why is that?)
• An efficient method for performing discrete convolution using Kronecker products
• Title not available (Why is that?)
• Automatic derivation and implementation of fast convolution algorithms
• Application of modular computing technique for high speed implementation of cyclic convolution
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions
• Two optimum algorithms for short convolutions
• On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
• Title not available (Why is that?)

This page was built for publication: Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

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