The following pages link to (Q4040743):
Displaying 12 items.
- An integer approximation method for discrete sinusoidal transforms (Q411197) (← links)
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system (Q1382940) (← links)
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system (Q1382941) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- Low-complexity 8-point DCT approximation based on angle similarity for image and video coding (Q2002406) (← links)
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\) (Q2003161) (← links)
- An orthogonal 16-point approximate DCT for image and video compression (Q2014160) (← links)
- The equivariant complexity of multiplication in finite field extensions (Q2693365) (← links)
- Fast multipole methods for particle dynamics (Q3437369) (← links)
- Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms (Q4643325) (← links)
- Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
- On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings (Q5957408) (← links)
