摘要
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.
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.
