Design of efficient architectures for discrete orthogonal transforms using bit level systolic structures
- 1 January 2002
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Computers and Digital Techniques
- Vol. 149 (1) , 17
- https://doi.org/10.1049/ip-cdt:20020159
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- High throughput VLSI implementation of discrete orthogonal transforms using bit-level vector-matrix multiplierIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1999
- Some new designs of 2-D array for matrix multiplication and transitive closureIEEE Transactions on Parallel and Distributed Systems, 1995
- Design of efficient regular arrays for matrix multiplication by two-step regularizationIEEE Transactions on Parallel and Distributed Systems, 1995
- Novel VLSI implementation of (8×8) point 2-DDCTElectronics Letters, 1994
- Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decompositionIEEE Transactions on Computers, 1990
- VLSI implementation of a 16*16 discrete cosine transformIEEE Transactions on Circuits and Systems, 1989
- A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- A Two's Complement Parallel Array Multiplication AlgorithmIEEE Transactions on Computers, 1973