DIGITALCP4.pptVIP

CHAPTER 4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION; CHAPTER 4 Adjacency ( 相邻 ) Karnaugh map ( 卡诺图 ) Associative law ( 结合律 ) Cell ( 单元 ) Boolean expression (布尔表达式 ) Commutative law ( 交换律 ) Distributive law ( 分配律 ) Domain ( 定义域 ) “ Don’t care “ ( 无关项 ) Literal (变量) Product-of-sums ( POS ) ( 和项之积 ) Product term (积项 ) Sum-of-products ( SOP) ( 积项之和 ) Sum term ( 和项 ) Variable ( 变量 ) ;KEY TERMS;Boolean expression An arrangement of variables and logical operators used to express the operation of a logic circuit. Cell An area on a Karnaugh map that represents a unique combination of variables in product form.;Commutative law In addition (ORing) and multiplication (ANDing) of two variables, the order in which the variables are ORed orANDed makes no diffence. Domain All of the variables in a Boolean expression. ;Distributive law ORing several variables and then ANDing the result with a single variable is equivalent to ANDing the single variable with each of the several variables and then ORing the products. “Don’t care” A combination of input literals that cannot occur and can be used as a 1 or a 0 on a Karnaugh map. ;Literal A variable or the complement of a variable. Product-of-sums (POS) A form of Boolean expression that is basically the ANDing of ORed terms. Product term The Boolean product of two or more literals equivalent to an AND operation.;Sums -of-products (SOP) A form of Boolean expression that is basically the ORing of ANDed terms. Sum term The Boolean sum of two or more literals equivalent to an OR operation. Variable A symbol used to represent a logical quantity that can have a value of 1 or 0, usually designated by an italic letter. ; Boolean algebra is the mathematics of digital systems. A basic knowledge of Boolean algebra is indispensable to the study and analysis of logical circuits. In the last chapter, Boolean operations and e