Please choose your delivery country and your customer group
Algorithm for multithreshold threshold element synthesis, generalizing Haring's "run measure minimization" algorithm, is presented; algorithm is based on possibility of assigning equal weights to variables in symmetry group of given Boolean function (for totally or partially symmetric Boolean functions); although supplementary operation is required for determining symmetry group of Boolean functions, both important reduction in number of tests required to minimize number of thresholds and more economic solution are assured, when synthesizing totally or partially symmetric Boolean functions; for nonsymmetric Boolean functions, algorithm is identical to "run measure minimization" algorithm, but it is shown that only n!2n-1 tests are sufficient to minimize number of thresholds, compared to n!2n tests required by Haring. (43781)