Pages that link to "Item:Q5941167"
From MaRDI portal
The following pages link to A new fast algorithm for computing prime-Length DCT through cyclic convolutions. (Q5941167):
Displaying 6 items.
- Bilinear algorithms for discrete cosine transforms of prime lengths (Q1031295) (← links)
- Convolution-based DCT algorithm (Q3359715) (← links)
- Computation of an odd-length DCT from a real-valued DFT of the same length (Q3991431) (← links)
- An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput (Q4564655) (← links)
- Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures (Q4588038) (← links)
- (Q4891607) (← links)