翻訳と辞書 Words near each other ・ Implementation intention ・ Implementation maturity model assessment ・ Implementation of bus rapid transit by country ・ Implementation of mathematics in set theory ・ Implementation research ・ Implementation Rule ・ Implementation shortfall ・ Implementation theory ・ Implementer ・ Implementer (video games) ・ Implementing Recommendations of the 9/11 Commission Act of 2007 ・ Implements of Hell ・ Implenia ・ Impler family ・ Implerstraße (Munich U-Bahn) ・ Implicant ・ Implicate and explicate order ・ Implication ・ Implication (information science) ・ Implication graph ・ Implication table ・ Implication-Realization ・ Implicational hierarchy ・ Implicational propositional calculus ・ Implications of divorce ・ Implications of Puerto Rico's current political status ・ Implications of U.S. gene patent invalidation on Australia ・ Implicature ・ Implicit ・ Implicit and explicit atheism Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Implicant ： ウィキペディア英語版 Implicant In Boolean logic, an implicant is a "covering" (sum term or product term) of one or more minterms in a sum of products (or maxterms in a product of sums) of a Boolean function. Formally, a product term ''P'' in a sum of products is an implicant of the Boolean function ''F'' if ''P'' implies ''F''. More precisely: : ''P'' implies ''F'' (and thus is an implicant of ''F'') if ''F'' also takes the value 1 whenever ''P'' equals 1. where * ''F'' is a Boolean function of ''n'' variables. * ''P'' is a product term. This means that P$=>$F with respect to the natural ordering of the Boolean space. For instance, the function :$f(x,y,z,w)=xy+yz+w$ is implied by $xy$, by $xyz$, by $xyzw$, by $w$ and many others; these are the implicants of $f$. == Prime implicant == A prime implicant of a function is an implicant that cannot be covered by a more general (more reduced - meaning with fewer literals) implicant. W.V. Quine defined a ''prime implicant'' of ''F'' to be an implicant that is minimal - that is, the removal of any literal from ''P'' results in a non-implicant for ''F''. Essential prime implicants are prime implicants that cover an output of the function that no combination of other prime implicants is able to cover. Using the example above, one can easily see that while $xy$ (and others) is a prime implicant, $xyz$ and $xyzw$ are not. From the latter, multiple literals can be removed to make it prime: *$x$, $y$ and $z$ can be removed, yielding $w$. *Alternatively, $z$ and $w$ can be removed, yielding $xy$. *Finally, $x$ and $w$ can be removed, yielding $yz$. The process of removing literals from a Boolean term is called expanding the term. Expanding by one literal doubles the number of input combinations for which the term is true (in binary Boolean algebra). Using the example function above, we may expand $xyz$ to $xy$ or to $yz$ without changing the cover of $f$. 〔De Micheli, Giovanni. ''Synthesis and Optimization of Digital Circuits''. McGraw-Hill, Inc., 1994〕 The sum of all prime implicants of a Boolean function is called its complete sum, minimal covering sum, or Blake canonical form. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Implicant」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.