Pages that link to "Item:Q2734324"
From MaRDI portal
The following pages link to On the computation of two-dimensional DCT (Q2734324):
Displaying 16 items.
- An efficient algorithm for the 2-D discrete cosine transform (Q673366) (← links)
- A fast algorithm for the computation of 2-D forward and inverse MDCT (Q971411) (← links)
- A parallel algorithm for \(4\times 4\) DCT (Q1291021) (← links)
- General approach for the realization of DCT/IDCT using convolutions (Q1329472) (← links)
- Fast recursive algorithms for 2-D discrete cosine transform. (Q1575779) (← links)
- Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format (Q1847372) (← links)
- Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding (Q2267025) (← links)
- On computing the 2-D FFT (Q2723624) (← links)
- A refined fast 2-D discrete cosine transform algorithm (Q2732816) (← links)
- New polynomial transform algorithm for multidimensional DCT (Q2734409) (← links)
- Convolution-based DCT algorithm (Q3359715) (← links)
- A new algorithm to compute the DCT and its inverse (Q3985196) (← links)
- On the odd-DFT and its applications to DCT/IDCT computation (Q4587860) (← links)
- Shifted Fourier transform-based tensor algorithms for the 2-D DCT (Q5353546) (← links)
- Low-Complexity Scaling Methodsfor DCT-II Approximations (Q5868708) (← links)
- Parallel, pipelined and folded architectures for computation of 1-D and 2-D DCT in image and video codec (Q5947745) (← links)
