Blake canonical form

In Boolean logic, a formula for a Boolean function f is in Blake canonical form (BCF), also called the complete sum of prime implicants, the complete sum, or the disjunctive prime form, when it is a disjunction of all the prime implicants of f.

ABD + ABC + ABD + ABC

ACD + BCD + ACD + BCD

Boolean function with two different minimal forms. The Blake canonical form is the sum of the two.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.