ILP-Based Bitwidth-Aware Subexpression Sharing for Area Minimization in Multiple Constant Multiplication

Bu-Ching LIN  Juinn-Dar HUANG  Jing-Yang JOU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A   No.4   pp.931-939
Publication Date: 2014/04/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.931
Type of Manuscript: PAPER
Category: VLSI Design Technology and CAD
finite impulse response (FIR) filter,  multiple constant multiplication (MCM),  bitwidth,  integer linear programming (ILP),  

Full Text: PDF>>
Buy this Article

The notion of multiple constant multiplication (MCM) is extensively adopted in digital signal processing (DSP) applications such as finite impulse filter (FIR) designs. A set of adders is utilized to replace regular multipliers for the multiplications between input data and constant filter coefficients. Though many algorithms have been proposed to reduce the total number of adders in an MCM block for area minimization, they do not consider the actual bitwidth of each adder, which may not estimate the hardware cost well enough. Therefore, in this article we propose a bitwidth-aware MCM optimization algorithm that focuses on minimizing the total number of adder bits rather than the adder count. It first builds a subexpression graph based on the given coefficients, derives a set of constraints for adder bitwidth minimization, and then optimally solves the problem through integer linear programming (ILP). Experimental results show that the proposed algorithm can effectively reduce the required adder bit count and outperforms the existing state-of-the-art techniques.