Pages that link to "Item:Q677546"

The following pages link to Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings (Q677546):

Displaying 8 items.

• Convolution algorithms, based on the CRT (Chinese remainder theorem). (Q554693) (← links)
• Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
• A fast algorithm for exact convolution of rational sequences by using integer arithmetics only (Q1091077) (← links)
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions (Q1190157) (← links)
• The AICE-CRT and digital signal processing algorithms: The complex case (Q1345182) (← links)
• On the factorization of polynomials and direct sum properties in integer polynomial rings (Q1922613) (← links)
• An efficient method for performing discrete convolution using Kronecker products (Q2784159) (← links)
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings (Q3698249) (← links)