An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n/(1 + (n-1)2-n) times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR fun...An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n/(1 + (n-1)2-n) times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR function with n input variables.展开更多
A method is presented for optimizing multiple-output exclusive-OR logic circuits. The effect of common gates on the optimization of logic circuits is studied. The concepts of common function, residue function and rema...A method is presented for optimizing multiple-output exclusive-OR logic circuits. The effect of common gates on the optimization of logic circuits is studied. The concepts of common function, residue function and remainder term are introduced. A computer method for searching the optimum polarity is proposed. This method can be used to design the logic circuit which needs the minimum number of exclusive-OR gates.展开更多
文摘An efficient computer algorithm for minimisation of exclusive-OR logic function is presented. The algorithm is n/(1 + (n-1)2-n) times faster than fast Reed-Muller transform algorithm for minimizing an exclusive-OR function with n input variables.
文摘A method is presented for optimizing multiple-output exclusive-OR logic circuits. The effect of common gates on the optimization of logic circuits is studied. The concepts of common function, residue function and remainder term are introduced. A computer method for searching the optimum polarity is proposed. This method can be used to design the logic circuit which needs the minimum number of exclusive-OR gates.
