Pages that link to "Item:Q1031295"
From MaRDI portal
The following pages link to Bilinear algorithms for discrete cosine transforms of prime lengths (Q1031295):
Displaying 6 items.
- New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks (Q839079) (← links)
- New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard (Q1048852) (← links)
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform (Q3823114) (← 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)
- A new fast algorithm for computing prime-Length DCT through cyclic convolutions. (Q5941167) (← links)