Logicgatelevelpart1.pptVIP

Logic Gate Level Combinational Circuits, Part 1 Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: combinational: input determines output sequential: output not entirely dependent on input We will focus first on combinational networks Black box view of network Inputs: a, b, c Outputs: x, y Describing combinational networks 3 common methods for describing combinational networks, ordered from most to least abstract: Truth tables Boolean expressions Logic diagrams Truth tables Most like black box view: specifies what network does, not how lists output for every possible combination of input values Next slide illustrates truth table for a 3-input, 2-output combinational network Note that the table has 8 entries – in general, n inputs translates to 2n entries Truth table a b c x y 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 1 1 1 1 0 0 0 1 1 0 1 0 0 1 1 0 0 0 1 1 1 0 0 Boolean algebra A Boolean algebraic expression describes both what a network does and how it does it Boolean values: 1 = true 0 = false Binary operations in order of precedence: ? = AND (may be omitted; ab same as a ? b) + = OR Unary operation: ’ = NOT Fundamental properties of Boolean algebra Commutative a + b = b + a ab =ba Associative (a + b) + c = a + (b + c) (ab)c = a(bc) Distributive a + (bc) = (a + b)(a + c) a(b + c) = ab + ac Identity a + 0 = a a ? 1 = a Complement a + a’ = 1 a ? a’ = 0 Note, in particular, how the distributive property of Boolean algebra differs from regular algebra – in regular algebra, multiplication (denoted with ?) distibrutes over addition (+), but not vice versa, as the operations represented by these symbols (AND and OR) do in Boolean algebra Duality Boolean algebra has symmetry that doesn’t exist in regular algebra: every property (and thus every expression) has a dual To construct the dual of an expression: exchange + and ? operations exchange 1 and 0 Examples the dual of c(a + b) is c + ab the dual of x + 0 is x ? 1 Simplifying ex