Pages that link to "Item:Q3680230"

The following pages link to Number theoretic transforms for the calculation of convolutions (Q3680230):

Displaying 15 items.

• Convolution algorithms, based on the CRT (Chinese remainder theorem). (Q554693) (← links)
• Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
• Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings (Q677546) (← links)
• Cosine transforms over fields of characteristic 2 (Q897337) (← links)
• Special algorithms for convolutions over Galois fields (Q1071810) (← links)
• A fast algorithm for exact convolution of rational sequences by using integer arithmetics only (Q1091077) (← links)
• A method for calculating probability convolution using ``trinary'' numbers with application in the determination of twin zygosity. (Q1275106) (← links)
• Computer implementation of efficient discrete-convolution algorithms (Q1842459) (← links)
• Number theoretic transform: generalization, optimization, concrete analysis and applications (Q2057175) (← links)
• Convolution using a conjugate symmetry property for number theoretic transforms over rings of regular integers (Q3680231) (← links)
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings (Q3698249) (← links)
• A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform (Q3985198) (← links)
• (Q4008013) (← links)
• (Q4313825) (← links)
• Enhancing Mersenne transforms by RNS with application to discrete convolution (Q4352603) (← links)