1. Logic and Sequential Circuit Design (EC – 201)

2. Textbook Digital Logic and Computer Design by M. Morris Mano (Jan 2000 )

3. Topics Boolean Algebra and Logic Gates: Binary Logic and Gates, Boolean Algebra and Functions, Canonical and Standard Forms, Logic Operations, Digital Logic Gates, and IC Digital Families. Simplification of Boolean Functions: K-Map Method and Simplification using Different Variables Map, Simplification of Product of Sums, Implementation with NAND and NOR Gates, Don’t Care Conditions, The Tabulation Method, Determination of Prime-Implicants, and Selection of Prime-Implicants.

4. Continue… Combinational Logic Design: Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure, Multilevel NAND Circuits, Multilevel NOR Circuits, Exclusive-OR, and Equivalence Functions Combinational Logic with MSI and LSI: Decimal Adder, Magnitude Comparator, Decoders, Encoders, Multiplexers, Demultiplexers, Binary Adders, Binary Subtraction, Binary Adder- Subtractors, Binary Multipliers and HDL Representation – VHDL/Verilog

5. Continue… Sequential Logic/Circuits: Latches, Flip-Flops, Triggering of Flip-Flops, Clocked Sequential Circuits and their Analysis, State Reduction and Assignment, Flip-Flop Excitation Tables, Design Procedure, Designing with D & JK Flip-Flops, HDL/Verilog Representation for a Sequential Circuits – VHDL/Verilog

6. Boolean Algebra & Logic Gates

7. Common Postulates (Boolean Algebra) Closure N={1,2,3,4,5,…..} It is closed w.r.t + i.e. a+b=c asa,b,cΣN Associative Law (x*y)*z = x*(y*z) for all x,y,z,ΣS Commutative Law x*y = y*x for all x,yΣS x+y = y+x x.Y = y.x

8. Common Postulates (Boolean Algebra) Identity Element e*x = x*e = xx Σ S e+x = x+e = x 0+x = x+0 = x 1*x = x*1 = x Inverse x*y = e  a*1/a = 1 x+y = e a+(-a) = 0 Distributed Law x*(y.z) = (x*y). (x*z) x.(y+z) = (x.y) + (x.z) x+(y.z) = (x+y). (x+z) x+0 = 0+x = x x.1 = 1.x = x x+x’ = 1 x.x’ = 0

9. Boolean Algebra and Logic Gates xyx.yxyx+yxx’ 00000001 01001110 100101 111111 xyzY+zx.(y+z)x.yx.z(x.y)+x.z 00000000 00110000 01010000 01110000 10000000 10111011 11011101 11111111 x.(y+z) = (x.y)+(x.z)

10. Postulates and Theorems of Boolean Algebra Postulate 2(a) x+0 = x(b) x.1 = x Postulate 5(a) x+x’ = 1(b) x.x’ = 0 Theorem 1(a) x+x = x(b) x.x = x Theorem 2(a) x+1 = 1(b) x.0 = 0 Theorem3, involution (x’)’ = x Postulate3, commutative(a) x+y = y+x(b) xy = yx Theorem4, associative(a) x+(y+z)=(x+y)+z(b) x(yz) = (xy)z Postulate4, distributive(a) x(y+z)=xy+xz(b) x+yz = (x+y)(x+z) Theorem5, DeMorgan(a) (x+y)’ = x’y’(b) (xy)’ = x’+y’ Theorem6, absorption(a) x+xy = x(b) x(x+y)=x

11. Theorems 1a.x+x = x x+x = (x+x).1 = (x+x)(x+x’) = x+xx’ =x+0 =x 1b.x.x = x (Remember Duality of 1a) x.x = xx+0 = xx+xx’ = x(x+x’) = x.1 =x

12. Theorems 2a.x+1 = 1 x+1 =1.(x+1) = (x+x’)(x+1) = (x+x’) = x+x’ = 1 2b.X.0 = 0 (Remember Duality of of 2a)

13. 3. (x’)’ = x Complement of x = x’ Complement of x’ = (x’)’ = x 6ax+xy = x x+xy = x.1+xy = x(1+y) = x.1 =x 6b.x(x+y) = x (Remember Duality of 6a) Can also be proved using truth table method

14. xyxyx+xy 0000 0100 1001 1111 xyx+y(x+y)’x’y’x’y’ 0001111 0110100 1010010 1110000 x=x+xy (x+y)’ = x’y’  DeMorgan’s Theorem (xy)’ = x’ +y’  DeMorgan’s Theorem

15. Operator Precedence 1.( ) 2.NOT 3.AND 4.OR

16. x y xy’xyx’y x y x y z x+(y+z) x y z xy+xz VENN DIAGRAM FOR TWO VARIABLES VENN DIAGRAM ILLUSTRATION X=XY+X VENN DIAGRAM ILLUSTRATION OF THE DISTRIBUTIVE LAW x’y’ x y

17. TRUTH TABLE FOR F 1 =xyz’, F 2 =x+y’z, F 3 =x’y’z+x’yz+xy’ and F 4 =xy’+x’z xyzF1F2F3F4 0000000 0010111 0100000 0110011 1000111 1010111 1101100 1110100

18. x y z F1 z y F2 x (a) F1 = xyz’ (b) F2 = x+y’z (c) F3 = x’y’z+x’yz+xy’ F3 z y x

19. (c) F4 = xy’+x’z F4 z y x Implementation of Boolean Function with GATES

20. Algebraic Manipulations for Minimization of Boolean Functions (Literal minimization) 1.x+x’y = (x+x’)(x+y) = 1.(x+y)=x+y 2.x(x’+y) = xx’+xy = 0+xy=xy 3.x’y’z+x’yz+xy’ = x’z(y’+y)+xy’ = x’z+xy’ 4.xy+x’z+yz (Consensus Theorem) =xy+x’z+yz(x+x’) =xy+x’z+xyz+x’yz =xy(1+z)+x’z(1+y) =xy+x’z 5.(x+y)(x’+z)(y+z)=(x+y)(x’+z) by duality from function 4

21. Complement of a Function (A+B+C)’ = (A+X)’ = A’X’ = A’.(B+C)’ = A’.(B’C’) = A’B’C’  (A+B+C+D+…..Z)’ = A’B’C’D’…..Z’ (ABCD….Z)’ = A’+B’+C’+D’+….+Z’ Example using De Morgan’s Theorem (Method-1) F1 = x’yz’+x’y’z F1’ = (x’yz’+x’y’z)’ = (x+y’+z)(x+y+z’) F2 = x(y’z’+yz) F2’= [x(y’z’+yz)]’ = x’+(y+z)(y’+z’)

22. Example using dual and complement of each literal (Method-2) F1 = x’yz’ + x’y’z Dual of F1 = (x’+y+z’)(x’+y’+z) Complement  F1’ = (x+y’+z)(x+y+z’) F2 = x(y’z’+yz) Dual of F2=x+[(y’+z’)(y+z] Complement =F2’= x’+ (y+z)(y’+z’)

23. Minterm or a Standard Product n variables forming an AND term provide 2 n possible combinations, called minterms or standard products (denoted as m1, m2 etc.). Variable primed if a bit is 0 Variable unprimed if a bit is 1 Maxterm or a Standard Sum n variables forming an OR term provide 2 n possible combinations, called maxterms or standard sums (denoted as M1,M2 etc.). Variable primed if a bit is 1 Variable unprimed if a bit is 0

24. MINTERMS AND MAXTERMS FOR THREE BINARY VARIABLES MINTERMSMAXTERMS xyzTermDesignationTermDesignation 000x’y’z’m0x+y+zM0 001x’y’zm1x+y+z’M1 010x’yz’m2x+y’+zM2 011x’yzm3x+y’+z’M3 100xy’z’m4x’+y+zM4 101xy’zm5x’+y+z’M5 110xyz’m6x’+y’+zM6 111xyzm7x’+y’+z’M7

25. FUNCTION OF THREE VARIABLES xyzFunction f1Function f2 00000 00110 01000 01101 10010 10101 11001 11111 f1 = x’y’z+xy’z’+xyz =m1 + m4 + m7 f2 = x’yz+xy’z+xyz’+xyz = m3 + m5 + m6 + m7

26. MINTERMS AND MAXTERMS FOR THREE BINARY VARIABLES f1 = x’y’z+xy’z’+xyz f1’ = x’y’z’+x’yz’+x’yz+xy’z+xyz’ f1 =(x+y+z)(x+y’+z)(x+y’+z’)(x’+y+z’) (x’+y’+z) = M0.M2.M3.M5.M6 = M0M2M3M5M6 f2 = x’yz+xy’z+xyz’+xyz f2’ = x’y’z’+x’y’z+x’yz’+xy’z’ f2 = (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z) = M0 M1 M2 M4 Canonical Form Boolean functions expressed as a sum of minterms or product of maxterms are said to be in canonical form. M3+m5+m6+m7 or M0 M1 M2 M4

27. Sum of Minterms (Sum of Products) Example: F = A+B’C F = A(B+B’)+B’C(A+A’) = AB+AB’+AB’C+A’B’C = AB(C+C’)+AB’(C+C’)+AB’C+A’B’C = ABC+ABC’+AB’C+AB’C’+AB’C+A’B’C = A’B’C+AB’C’+AB’C+ABC’+ABC = m1+m4+m5+m6+m7 F(A,B,C)=  (1,4,5,6,7) ORing of termAND terms of variables A,B &C They are minterms of the function

28. Product of Maxterms (Product of sums) Example: F = xy+x’z F = xy+x’z F = (xy+x’)(xy+z) distr.law (x+yz)=(x+y)(x+z) = (x+x’)(y+x’)(x+z)(y+z) = (x’+y)(x+z)(y+z) = (x’+y+zz’)(x+z+yy’)(y+z+xx’) = (x’+y+z)(x’+y+z’)(x+z+y)(x+z+y’)(y+z+x)(y+z+x’) = (x+y+z)(x+y’+z)(x’+y+z)(x’+y+z’) = M0 M2 M4 M5 F(x,y,z) =  (0,2,4,5) ANDing of termsMaxterms of the function (4 OR terms of variables x,y&z)

29. Conversion between Canonical Forms F(A,B,C) =  (1,4,5,6,7)  sum of minterms F’(A,B,C) =  (0,2,3) = m0+m2+m3 F(A,B,C) = (m0+m2+m3)’ = m0’.m2’.m3’ = M0 M2 M3 =  (0,2,3)  Product of maxterms Similarly F(x,y,z) =  (0,2,4,5) F(x,y,z) =  (1,3,6,7)

30. Standard Forms Sum of Products (OR operations) F1 = y’+xy+x’yz’ (AND term/product term) Product of Sums (AND operations) F2=x(y’+z)(x’+y+z’+w) (OR term/sum term) Non-standard form F3=(AB+CD)(A’B’+C’D’) Standard form of F3 F3=ABC’D’ + A’B’CD

31. TRUTH TABLE FOR THE 16 FUNCTIONS OF TWO BINARY VARIABLES xyF0F1F2F3F4F5F6F7F8F9F10F11F12F13F14F15 000000000011111111 010000111100001111 100011001100110011 110101010101010101 Operator symbols +, ,  F0 = 0F1 = xyF2 = xy’F3 = x F4 = x’yF5 = yF6 = xy’ +x’yF7= x +y F8 = (x+y)’ F9 = xy +x’y’F10 = y’F11 = x +y’ F12 = x’F13 = x’ + yF14 = (xy)’F15 = 1

32. BOOLEAN EXPRESSIONS FOR THE 16 FUNCTIONS OF TWO VARIABLE BOOLEANOPERATORNAMECOMMENTS FUNCTIONSSYMBOL F0 =0NULL BINARY CONSTANT 0 F1=xyx.yAND x and y F2=xy’x/yinhibition x but not y F3=xtransfer x F4=x’yy/x inhibition y but not x F5=ytransfer y F6=xy’+x’yx yexclusive-OR x or y but not both F7=x+y x+y OR x or y F8=(x+y)’ x y NOR not OR F9=xy+x’y’ x y *equivalence x equals y F10=y’y’complement not y F11=x+y’x  yimplication if y then x F12=x’ x’ complement not x F13=x’+yx  y implication if x then y F14=(xy)’x yNAND not AND F15=1IDENTITY BINARY CONSTANT 1

33. *Equivalence is also known as equality, coincidence, and exclusive NOR 16 logic operations are obtained from two variables x &y Standard gates used in digital design are: complement, transfer, AND, OR, NAND, NOR, XOR & XNOR (equivalence).

34. H and L LEVEL IN IC LOGIC FAMILIES IC Family Voltage Type Supply (V) High-level voltage (V) Range Typical Low-level voltage (V) TTL Vcc=5 ECL VEE=-5.2 CMOS VDD=3--10 Positive Logic: Negative Logic 2.4-5 3.5 -0.95- -0.7 -0.8 VDD Logic-1 Logic-0 0-0.4 0.2 -1.9-- -1.6 -1.8 0-0.5 0 Logic-0 Logic-1 Range Typical

35. TYPICAL CHARACTERISTICS OF IC LOGIC FAMILIES IC Logic Family Fan outPower Dissipation (mw) Propagation delay (ns) Noise Margin (v) Standard TTL Shottky TTL Low power Shottky TTL ECL CMOS 10 20 25 50 10 22 2 25 0.1 10 3 10 2 25 0.4 0.2 3 TTL basic circuit : NAND gate ECL basic circuit: NOR gate CMOS basic circuit: Inverter to construct NAND/NOR

36. DIGITAL LOGIC GATES NAMEGRAPHIC SYMBOL ALGEBRIC FUNCTION TRUTH TABLE ANDF=XYX Y F 0 0 0 0 1 0 1 0 0 1 1 1 ORF=X+YX Y F 0 0 0 0 1 1 1 0 1 1 1 1 X Y F Y X F

37. NAMEGRAPHIC SYMBOL ALGEBRIC FUNCTION TRUTH TABLE Inverter F=X’ X F 0 1 1 0 Buffer F=X X F 0 1 NANDF=(XY)’ X Y F 0 0 1 0 1 1 1 0 1 1 1 0 XF XF X F Y

38. NAMEGRAPHIC SYMBOL ALGEBRIC FUNCTION TRUTH TABLE NORF=(X+Y)’ X Y F 0 0 1 0 1 0 1 0 0 1 1 0 Exclusive-OR (XOR) F=XY’+X’Y = X  Y X Y F 0 0 0 0 1 1 1 0 1 1 1 0 Exclusive-NOR or Equivalence F=XY+X’Y’ =X Y X Y F 0 0 1 0 1 0 1 0 0 1 1 1 F Y X X F Y F X Y

39. Y (X Y) Z=(X+Y) Z’ Y x (X+Y)’ =XZ’+YZ’ [Z+(X+Y)’]’ (Y+Z)’ (X ( Y Z)=X’(Y+ Z) =X’Y+X’Z [X+(Y+Z)’]’ Z X Z Demonstrating the nonassociativity of the NOR operator (X  Y)  Z  X  (Y  Z)

40. X Y Z (X+Y+Z)’ X Y Z (XYZ)’ (a) There input NOR gate(b) There input NAND gate A B C D E F=[(ABC)’. (DE)’]’=ABC+DE (c) Cascaded NAND gates Multiple-input AND cascaded NOR and NAND gates

41. X Y Z F=X  Y  Z (a) Using two input gates X Y Z (b) Three input gates (b) Three input exclusive OR gates TRUTH TABLE X Y Z F 0 0 00 1 0 0 11 0 0 1 01 0 0 1 10 1 1 0 01 0 1 0 10 1 1 1 00 1 1 1 11 0 XOR XNOR Odd function Even function F=X  Y  Z

42. IC DIGITAL LOGIC FAMILIES TTL  Transistor- Transistor Logic Very popular logic family. It has a extensive list of digital functions. It has a large number of MSI and SSI devices, also has LSI devices. ECL  Emitter Coupled Logic Used in systems requiring high speed operations. It has a large number of MSI and SSI devices, also LSI devices. MOS  Metal-Oxide Semiconductor Used in circuit requiring high component density It has a large number of MSI and SSI devices, also LSI devices (mostly) CMOS  Complementary MOS Used in systems requiring low power consumption. It has a large number of MSI and SSI devices, also has LSI devices. I 2 L  Integrated - Injection Logic Used in circuit requiring high component density. Mostly used for LSI functions

43. 1 2 3 4 5 6 7 14 13 12 11 10 9 8 VCC GND 1 2 3 4 5 6 7 14 13 12 11 10 9 8 VCC GND Some Typical IC Gates 7400 Quadruple 2-input NAND gates 7404 Hex Inverters TTL gates

44. 16 15 14 13 12 11 10 9 1 2 3 4 5 6 7 8 VCC 2 VEE 2 (-5.2V) VCC 1 10107 Triple Exclusive – OR/ NOR gates 16 15 14 13 12 11 10 9 1 2 3 4 5 6 7 8 VCC 2 VCC 1 VEE (-5.2V) 10102 Quadruple 2-Input NOR gate Some Typical IC Gates

45. 123456 NC 7 Vss (GND) NC 8 910111213 VDD 14 (3-15 V) C MOS GATES 4002 dual 4 input NOR gates

46. NC 16 1 VDD 3 4 5678 Vss (GND) 91011121415 2 (3-15 V) 4050 Hex buffer CMOS GATES NC 13

47. 0 1H L 0 1 H L LOGIC VALUE SIGNAL VALUE LOGIC VALUE SIGNAL VALUE Negative Logic Positive Logic Signal amplitude assignment and type of logic

48. XyzLLHLHHHLHHHLXyzLLHLHHHLHHHL TTL 7400 GATE x y z Gate block diagram Truth table in terms of H and L Xyz001011101110Xyz001011101110 Truth table for positive logic H=1, L=0 x y z Graphic symbol for positive logic NAND gate

49. Xyz110101011001Xyz110101011001 Truth table for negative logic L=1 H=0 x z y Graphic symbol for negative logic NOR gate +ive logic NAND or -ive logic NOR +ive logic NOR or -ive logic NAND Same gate can function DEMONSTRATION OF POSITIVE AND NEGATIVE LOGIC

50. Fan-out Specifies the number of standard loads (the amount of current needed by an input of another gate in the same IC family) that the output of a gate can drive without impairing its normal operation. it is expressed by a number. Power dissipation It is the supplied power required to operate the gate. It is expressed in mw. Propagation delay It is the average transition delay time for a signal to propagate from input to output when the binary signals change in value. It is expressed in ns. Noise margin It is the maximum noise voltage added to the input signal of a digital circuit that does not cause an undesirable change in the circuit output. It is expressed in volts (v). Characteristics of IC logic families (parameters)