An algorithm for identifying and selecting the primed implicants of a multiple-output Boolean function
Sharon Ruth Perkins, T. Rhyne · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1988
A multiple-output Boolean minimization procedure is presented that generates a minimum cover with computational efficiency by extending the directed search algorithm to the multiple-output case. This procedure is applicable to manual execution as well as to automated execution, and to both conventional two-level gating structures and programmable logic arrays (PLAs).>