Primterm

As Implicant or prime implicant a Boolean function is called a Implicants minimum length, so that can not be further simplified.

The term is used when minimizing switching networks , e.g. B. with KV diagrams used. It then usually refers to conjunction terms in a disjunction of conjunction terms or minterms in a DNF . In this context, the length of a Boolean term is understood to mean the number of conjunctions and disjunctions it contains, although only conjunctions are of interest within a conjunction term.

detection

Where the primer terms can still be determined graphically with a KV diagram for Boolean functions with low arithmetic (1-5 variables), the Quine and McCluskey method should be used from 6 variables .

Core prime implicant

Prime terms that contain minter terms that do not appear in any other primer term are referred to as core prime implicants , essential prime implicants , or core primer terms . They must appear in every minimal disjunctive normal form .

Individual evidence

1. ^ Prof. Andreas König: Digital technology. Chapter 4. Chemnitz University of Technology, p. 12 , accessed on February 2, 2020 . 
2. ↑ Essential prime implicant. In: Lexicon of Mathematics. Spektrum, Springer Verlag, accessed on February 2, 2020 . 
3. ↑ Prof. Dr. Rita Loogen: Switching networks and their optimization. Philipps-Universität Marburg, p. 11 , accessed on February 2, 2020 . 
4. ↑ J. Nelson Amaral: Essential Prime Implicants. University of Alberta, accessed February 2, 2020 . 
5. ↑ Christian A. Mandery: Tutorials for the lecture "Digital technology and design techniques." Tutorial week 6. yumpu.com, September 12, 2011, p. 18 , accessed on February 2, 2020 .