Pages that link to "Item:Q4014159"
From MaRDI portal
The following pages link to On the multiplicative complexity of discrete cosine transforms (Q4014159):
Displaying 11 items.
- An integer approximation method for discrete sinusoidal transforms (Q411197) (← links)
- A generalized approach to linear transform approximations with applications to the discrete cosine transform (Q938993) (← links)
- Improvement of the discrete cosine transform calculation by means of a recursive method (Q969952) (← links)
- On matrix factorizations for recursive pruned discrete cosine transforms (Q1275141) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (Q3482811) (← links)
- Multiplicative complexity of discrete cosine and sine transform (Q3985181) (← links)
- Multiplicative complexity of length-2<sup>m</sup>two-dimensional discrete cosine transform (Q3985183) (← links)
- On the realization of discrete cosine transform using the distributed arithmetic (Q4033885) (← links)
- (Q4040743) (← links)
- (Q4864906) (← links)