Reduced-hardware digital filter design via joint quantization and multiple constant multiplication optimization

The focus of this paper is to provide a framework for the joint optimization of both the coefficient quantization and multiple constant multiplication (MCM) problems. It is known that while the MCM problem is complete in the subspace of integer constants, it is incomplete and not optimal in the real world where the MCM constants are often noninteger. In these situations there is flexibility in how constants are quantized in digital circuits that can be leveraged. There is a gap in the current literature between the methods of optimally quantizing constants into integers and the methods of optimizing circuits when integer constants are given. Here we show a potential for tremendous benefit when both of these problems are solved using one unified problem framework.

[1]  Levent Aksoy,et al.  Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Ngai Wong,et al.  Global optimization of common subexpressions for multiplierless synthesis of multiple constant multiplications , 2008, 2008 Asia and South Pacific Design Automation Conference.

[3]  R.B. Lake,et al.  Programs for digital signal processing , 1981, Proceedings of the IEEE.

[4]  Markus Püschel,et al.  Multiplierless multiple constant multiplication , 2007, TALG.

[5]  Andrew G. Dempster,et al.  Designing multiplier blocks with low logic depth , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).