IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multiplierless multiple constant multiplication
ACM Transactions on Algorithms (TALG)
An approximate algorithm for the multiple constant multiplications problem
Proceedings of the 21st annual symposium on Integrated circuits and system design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Design of low complexity digital FIR filters
Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes
Hi-index | 0.00 |
The Multiple Constant Multiplications (MCM), i.e., the multiplication of a variable by a set of constants, has been a central operation and performance bottleneck in many digital signal processing applications such as, image and video processing, digital television, and wireless communications. Since the design of multiplications is expensive in terms of area, delay, and power consumption in hardware, the area-delay optimization of the MCM operation has often been accomplished by using the shift-adds architecture. However, most of the previously proposed algorithms have focused on the optimization of area ignoring the crucial tradeoff between area and delay of the computation. In this paper, we introduce an approximate algorithm that can find near optimal area solutions under the user specified delay constraint. It is shown by the experimental results that the proposed algorithm finds better area-delay solutions than the previously proposed efficient algorithms.