High Speed and Low Power Dual Constant Multiplier

Abstract

To avoid the problem of dual constant multiplication radix 2^r arithmetic is applied. Consider a number of M non negative constants having bit length N. To form the critical path we are going to determine the formulas for maximum number of additions, average number of additions and maximum number of cascaded additions. The problems that are predictable with problem size (M, N) is solved by the dual constant multiplication radix 2^r approach. This radix 2^r approach gives the sub linear routine complexity O(M×N/r) where r is the function of (M,N). compared to other published DCM algorithms this algorithm gives the shortest path in addition. In case high complexity problems are occurred it is solved by this radix 2^r DCM algorithms. At last by using the dual constant multiplication radix 2^r algorithm the power is low power is consumed and high speed is obtained.