Pages that link to "Item:Q3991431"
From MaRDI portal
The following pages link to Computation of an odd-length DCT from a real-valued DFT of the same length (Q3991431):
Displaying 4 items.
- Bilinear algorithms for discrete cosine transforms of prime lengths (Q1031295) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- On the odd-DFT and its applications to DCT/IDCT computation (Q4587860) (← links)
- A new fast algorithm for computing prime-Length DCT through cyclic convolutions. (Q5941167) (← links)