PROJECT TITLE :

Multiple Constant Multiplication Algorithmfor High-Speed and Low-Power Design - 2016

ABSTRACT:

In this transient, Radix-2r arithmetic is applied to the multiple constant multiplication (MCM) problem. Given a variety M of nonnegative constants with a small amount length N, we determine the analytic formulas for the most number of additions, the average variety of additions, and the utmost range of cascaded additions forming the critical path. We get the first proven bounds known therefore so much for MCM. In addition to being absolutely predictable with respect to the matter size (M, N), the RADIX-2r MCM heuristic exhibits sublinear runtime complexity O(M × N/r), where r may be a perform of (M, N). For high-complexity issues, it is presumably the sole one that is even feasible to run. Another advantage is that it has the shortest adder depth as compared with the most effective printed MCM algorithms.