Pages that link to "Item:Q1802353"
From MaRDI portal
The following pages link to The multiplicative complexity of discrete cosine transforms (Q1802353):
Displaying 8 items.
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (Q3482811) (← links)
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform (Q3823114) (← 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 multiplicative complexity of discrete cosine transforms (Q4014159) (← links)
- On the realization of discrete cosine transform using the distributed arithmetic (Q4033885) (← links)
- (Q4040743) (← links)
- (Q4864906) (← links)