Pages that link to "Item:Q3048190"

The following pages link to New algorithms for digital convolution (Q3048190):

Displaying 14 items.

• Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
• Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
• Index transforms for multidimensional DFT's and convolutions (Q1119008) (← links)
• Numerical Fourier and Bessel transforms in logarithmic variables (Q1251888) (← links)
• Matrix displacement decompositions and applications to Toeplitz linear systems (Q1375094) (← links)
• Matrix decompositions using displacement rank and classes of commutative matrix algebras (Q1902113) (← links)
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
• Fast computation of convolution operations via low-rank approximation (Q2448383) (← links)
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
• Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
• Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
• Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
• (Q5150372) (← links)
• Realization of discrete Fourier transforms using a nesting algorithm (Q5751913) (← links)