A 6X6 Multiplier Based on MCM Method

Abstract — The digit-based recoding technique does not exploit the sharing of common partial products, which allows great reductions in the number of operations and, consequently, in area and power dissipation of the MCM design at the gate level. Hence, the fundamental optimization problem, called the MCM problem, is defined as finding the minimum number of addition and subtraction operations that implement the constant multiplications. Note that, in bit-parallel design of constant multiplications, shifts can be realized using only wires in hardware without representing any area cost. The main idea of digit serial technique is to find the terms which are common between different constants and decreasing the number of repeated operations. There are some algorithms in the literature which deal with CSE and in most of them there are three main steps involved: Identifying the presence of multiple patterns in the input matrix of coefficients, selecting one pattern for elimination and eliminating all occurrences of the selected pattern. This process is iteratively repeated until there are no more multiple patterns present. The run time and quality of the solution are important metrics in these algorithms