In this paper, a number of decomposition based mapping techniques are proposed. In these techniques, the synthesis problem is formulated as a mapping from an input matrix to an output matrix. The minimization is obtained by constructing a matching-count matrix. The entries of the matching-count matrix MC/sub i,j/ represent the number of entry matches between the input variable number i in the input matrix (X) and the output function number j in the output matrix (Y). It then selects those input-output pairings that give the maximum matching count, thus maximizing the number of switching operations which can be eliminated in the realization of MVL functions. The proposed techniques are classified as: output-phase with complement, input-phase with and without complement. Numerical results are presented to show that the proposed techniques result in significant reduction in the number of switching operators required for the implementation of 5000 randomly generated r-valued functions (for r=3, 4, and 5).
['Mostafa H. Abd-El-Barr', 'Muhammad Hasan', 'Gamal Mabrouk A Hamid']
On the synthesis of MVL functions using input and output phase assignments