Pages that link to "Item:Q971426"
From MaRDI portal
The following pages link to Type-II/III DCT/DST algorithms with reduced number of arithmetic operations (Q971426):
Displaying 11 items.
- Recursive calculation of discrete cosine transform for low resolution signal processing (Q492722) (← links)
- Simple FFT and DCT algorithms with reduced number of operations. (Q554691) (← links)
- Improvement of the discrete cosine transform calculation by means of a recursive method (Q969952) (← links)
- Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations (Q971394) (← links)
- Cosine manifestations of the Gelfand transform (Q2114988) (← links)
- New algorithm for multidimensional type-III DCT (Q2732966) (← links)
- A new look at DCT-type transforms (Q3471695) (← links)
- Multiplicative complexity of discrete cosine and sine transform (Q3985181) (← links)
- Low-Complexity Scaling Methodsfor DCT-II Approximations (Q5868708) (← links)
- DCT-former: efficient self-attention with discrete cosine transform (Q6158987) (← links)
- A faster multipole Legendre-Chebyshev transform (Q6654574) (← links)
