IKI b-Logic Gates Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes at UIUC, which is derived from Howard Huang’s work and developed by Jeff Carlyle.

2 Road Map Boolean Algebra Logic Gates & Flip-flops Register-Transfer Design Finite-State Machines Binary Systems & Data Represent. Generalized FSM Sequential Design Techniques Logic Design Techniques Combinatorial Components Storage Components Processor Components

3 The Modest Switch Digital systems are basically built from an extremely simple component: – A controllable switch The usual Electrical switch we use every day – The electric switch we use turns current on and off – But we need to turn it on and off by hand – The result of turning the switch on? The “top end” in the figure becomes raised to a high voltage Which makes the current flow through the bulb The Controllable Switch No hands Voltage controls if the switch is on or off High voltage at input: switch on Otherwise it is off

4 Using the switch Output InputOutput is high (voltage) if and only if the input is high Now we can make one circuit control another switch… Neat! This is getting boring..

5 Lets use them creatively Output is high if both the inputs input1 AND input2 are high If either of the inputs is low, the output is low. Input1 Input2 Output This is called an AND gate Now, can you make an OR gate with switches?

6 OR Gate Input1 Input2 Output Output is low iff both inputs are low I.e. Output is high if either of the inputs (or both) are high (input1 OR input2)

7 How to make switches? Use mechanical power Use hydraulic pressure Use electromechanical switches (electromagnet turns the switch on) Current technology: – Semiconductor transistors A transistor can be made to conduct electricity depending on the input on the 3 rd input – CMOS “gates” (actually, switches) We can now manufacture millions of transistors on a single silicon chip! So, switches and Gates are not magic. We know they can be built.

8 Digital Logic Gates

9 Basic logic gates Each of our basic operations can be implemented in hardware using a basic logic gate. – Symbols for each of the logic gates are shown below. – These gates output the product, sum or complement of their inputs. Logic gate: AND (product) of two inputs OR (sum) of two inputs NOT (complement) on one input xy, or x  yx + yx’ Operation: Expression:

10 Expressions and circuits Any Boolean expression can be converted into a circuit by combining basic gates in a relatively straightforward way. The diagram below shows the inputs and outputs of each gate. The precedence is explicit in a circuit. Clearly, we have to make sure that the hardware does operations in the right order! (x + y’)z + x’

11 Exercises Implement the following functions using 2-level gates (Sum of Product) – assume complemented literal (x’) is already available – a gate can only have 2 inputs F1(x,y,z) = xy + yz + x’z’ F2(x,y,z) = (x + y’)z + x’ F3(x,y,z) = (x’ + y’)’ + xyz

12 NAND/NOR gates are used extensively and far more popular than AND/OR gates, simply because their implementation requires only 4 transistors (AND/OR uses 6 transistors). NAND/NOR are faster than AND/OR Additional logic gates NAND (NOT-AND) NOR (NOT-OR) XOR (eXclusive OR) (xy)’ = x’ + y’(x + y)’ = x’ y’x  y = x’y + xy’ Operation: Expressions: Logic gates:

13 NAND gates The NAND gate is universal: it can replace all other gates! – NOT – AND – OR (xx)’ = x’[ because xx = x ] ((xy)’ (xy)’)’ = xy[ from NOT above ] ((xx)’ (yy)’)’= (x’ y’)’[ xx = x, and yy = y ] = x + y[ DeMorgan’s law ]

14 Making NAND circuits The easiest way to make a NAND circuit is to start with a regular, primitive gate-based diagram. Two-level circuits are trivial to convert, so here is a slightly more complex random example.

15 Converting to a NAND circuit Step 1: Convert all AND gates to NAND gates using AND-NOT symbols, and convert all OR gates to NAND gates using NOT-OR symbols.

16 Converting to NAND, concluded Step 2: Make sure you added bubbles along lines in pairs ((x’)’ = x). If not, then either add inverters or complement the input variables.

17 NOR gates The NOR operation is the dual of the NAND. NOR gates are also universal. We can convert arbitrary circuits to NOR diagrams by following a procedure similar to the one just shown: – Step 1: Convert all OR gates to NOR gates (OR-NOT), and all AND gates to NOR gates (NOT-AND). – Step 2: Make sure that you added bubbles along lines in pairs. If not, then either add inverters or complement input variables.

18 XOR gates A two-input XOR gate outputs true when exactly one of its inputs is true: XOR corresponds more closely to typical English usage of “or,” as in “eat your vegetables or you won’t get any pudding.” Several fascinating properties of the XOR operation: x  y = x’ y + x y’

19 XNOR gates Finally, the complement of the XOR function is the XNOR function. A two-input XNOR gate is true when its inputs are equal: (x  y)’ = x’y’ + xy

20 Extension to Multiple Inputs & Multiple Operators Any gate can be extended to have multiple inputs as long as the binary operation it implements is commutative and associative. – AND(x,y,z,...) = (xyz...) = x  y  z ... – OR(x,y,z,...) = (x + y + z +...) = x + y + z +... – XOR(x,y,z,...) = (x  y  z ...) = x  y  z ... – XNOR(x,y,z,...) = (x  y  N z ...) = x  y  N z ... But, – NAND(x,y,z,...) = (xyz...)’  x  y  z ... – NOR(x,y,z,...) = (x + y + z +...)’  x  y  z ... Multiple gates will lower the cost (smaller number of transistors) and faster circuit (smaller delay)

21 Multiple inputs gates

22 Multiple operators gates

23 Gate implementations

24 Logic levels 2 voltage levels: – High (H): 5 Volts (3.3 or 1.8 Volts in some systems) – Low (L): 0 Volts Logic gate will generate output voltage whose value represent the logical value (1  H or 0  L) Logic gate will interpret its inputs based the input voltage (L  0 or H  1) H L

25 High noise margin Low noise margin H H LL V CC (5) V OH (2.4) V OL (0.4) GND(0) V CC (5.0) V IH (2.0) V IL (0.8) GND(0) Output voltage range Input voltage range Noise margins

26 Propagation delay Circuits made up of gates: – If you change the inputs, and wait for a while, the correct outputs show up. Why? Capacitive loading: – “fill up the water level” analogy. We can use a timing diagram to show gate delays graphically. In a circuit, when gates are connected in series, the delay will add up  propagation delay gate delays x x’

27 Fan-out Using the same “fill up the water level” analogy, a single output cannot drive too many inputs: – will be too slow to “fill them up” – may not have enough power Fan-out specifies the number of subsequent gates that can be driven by each gate, while providing voltage levels in the guaranteed range

28 Power dissipation Each gate generates power dissipation during its operation; the average power dissipation is: – P TTL = V cc  (I CCH + I CCL ) / 2[for TTL] – P CMOS = V cc  I CCT [for CMOS] – P CMOS << P TTL Power dissipation is proportional to the heat generated by the chip – excessive heat dissipation may cause gate circuitry to drift out of its normal operating range

29 Gate technology Bipolar – Transistor-transistor logic (TTL) – Emitter couple logic (ECL) – technology of the old days MOS (metal oxide silicon) – Complementary MOS (CMOS) – low power dissipation – high fan-out – simple fabrication – higher density (number of gates per area of silicon)

30 Small-scale integration (SSI) – 10 gates/package Medium-scale integration (MSI) – 10 – 100 gates/package Large-scale integration (LSI) – 100 – 1000 gates/package Very large-scale integration (VLSI) – gates/package (systems on a chip) – Custom design (standard cells) – Gate arrays (Gas) – Field-programmable gate arrays (FPGAs) Integrated Circuit (IC) technology

31 Effect of gate’s delay on circuit’s performance

32 Full-adder design using XOR gates s i = x i ’y i ’c i + x i ’y i c i ’ + x i y i ’c i ’ + x i y i c i = (x i ’y i + x i y i ’) c i ’ + (x i ’y i ’ + x i y i )c i = (x i  y i )c i ’ + (x i  y i )c i = (x i  y i )c i ’ + (x i  y i )’c i = (x i  y i )  c i c i+1 = x i ’y i c i + x i y i ’c i + x i y i c i ’ + x i y i c i = c i (x i ’y i + x i y i ’) + x i y i (c i ’ + c i ) = c i (x i  y i ) + x i y i longest delay = 9.0

33 Full-adder design using fast gates s i = (x i  y i )c i ’ + (x i  y i )c i = (x i  y i )’c i ’ + (x i  y i )c i = (x i  y i )  c i x i  y i = x i y i + x i ’y i ’ = ((x i y i )’  (x i ’y i ’)’)’ = ((x i y i )’  (x i + y i ))’ c i+1 = x i ’y i c i + x i y i ’c i + x i y i c i ’ + x i y i c i = x i y i + x i c i + y i c i = x i y i + (x i + y i )c i = ((x i y i )’  ((x i + y i )c i )’)’ longest delay = 7.6

34 Full-adder design using multiple-inputs gates s i = x i ’y i ’c i + x i ’y i c i ’ + x i y i ’c i ’ + x i y i c i = ((x i ’y i ’c i + x i ’y i c i ’)’  (x i y i ’c i ’ + x i y i c i )’)’ = ((x i ’y i ’c i )’  (x i ’y i c i ’)’  (x i y i ’c i ’ )’  (x i y i c i )’)’ c i+1 = x i y i + x i c i + y i c i = ((x i y i )’  (x i c i )’  (y i c i )’)’ longest delay = 4.0