On the realization of discrete cosine transform using the distributed arithmetic
From MaRDI portal
Recommendations
- On the discrete cosine transform computation
- Hardware-Efficient Realization of Prime-Length DCT Based on Distributed Arithmetic
- A modular approach to the computation of convolution sum using distributed arithmetic principles
- Concurrent computation of two-dimensional discrete cosine transform
- Recursive Implementation of the Distributed Karhunen-Loève Transform
- On the multiplicative complexity of discrete cosine transforms
- Result-Biased Distributed-Arithmetic-Based Filter Architectures for Approximately Computing the DWT
- An algorithm for distributed computation of FFTs
- The multiplicative complexity of discrete cosine transforms
Cited in
(6)- Bilinear algorithms for discrete cosine transforms of prime lengths
- A unified algorithm for subband-based discrete cosine transform
- A new algorithm to compute the DCT and its inverse
- Computation of an odd-length DCT from a real-valued DFT of the same length
- A new VLSI algorithm and architecture for the hardware implementation of type IV discrete cosine transform using a pseudo-band correlation structure
- An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm
This page was built for publication: On the realization of discrete cosine transform using the distributed arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033885)