Parallel Processing in Boolean Algebra

A processor called Boolean analyzer has been presented at the 1968 IFIP Congress to introduce parallel processing of Boolean expressions [1]. The present paper shows how to increase its speed many times by making its processing more parallel. The applications of the Boolean analyzer are limited to few but important problems. A typical problem of that kind: listing of all implicants of a function of 7 variables defined by not more than 100 term implicants (of the complement of that function) takes only about 40 μs (supposing a delay line storage working at the clock impulse rate of 2.10
⁶
/s).