Chapter 13

1. Chapter 13 Digital Electronic Principles Dr.Debashis De Associate Professor West Bengal University of Technology

2. Contents: • 13-1 Introduction • 13-2 Number System • 13-3 Conversion of Number System • 13-4 Boolean Algebra • 13-5 Logic Gates • 13-6 De Morgan’s Theorem • 13-7 Simplifi cation of Boolean Expression • 13-8 Logic Gate Circuits • 13-9 Applications of Digital Circuits

3. Objectives: • This chapter covers the fundamentals of digital electronics with a comprehensive overview of number systems, binary codes, logic gates and the applications of digital circuits. • Beginning with an introduction to the history of digital systems, the chapter proceeds to discuss the number system and the conversion from binary to decimal. This is followed by a detailed analysis of Boolean algebra and its laws, supplemented with relevant examples. • De Morgan’s theorem and logic gate circuits are also examined with emphasis on practical applications. The chapter ends with a brief analysis of the real-life applications of digital circuits.

4. INTRODUCTION: • The journey of digital electronics started in the year 1946 with the digital computer using vacuum tube technology. • The term “digit” is derived from the counting operation of the computer. The twenty-first century is the digital world. • Modern computers consist of digital components, starting from microprocessors to all other peripheral components. • A binary digital circuit operates in two modes/states: ON state [1 (one)] and OFF state [0 (zero)]. These states are called binary states. These binary digits are called bits. In the binary digital world the logic lies between these two states. This makes the digital states discrete in nature, whereas the analog states are continuous.

5. Conception of Digital Logic: • Digital logic can be of two different types—positive logic system and negative logic system. • Generally ,the digital circuits are connected with a dc supply battery (typically 5 V) and a ground terminal of 0 V. If the5 V refers to logic 1 or ON state and the ground 0 V refers to logic 0 or OFF state, the logic is referred to as positive logic. • On the contrary, if 5 V referrers to logic 0 and ground 0 V referrers to logic 1, then this logic is called negative logic.

6. Number System: • The number system digits occupy certain relative positions having their relative positional significance. • The left-most digit is called the most significant digit (MSD) and the right-most digit is called the lowest significant digit (LSD). • Number systems are classified on the basis of radix/base, as shown in Table 13-1.

7. CONVERSION OF NUMBER SYSTEM: • Conversion from one number system to another is an important aspect in digital electronics especially with respect to conversion from binary to decimal, decimal to binary, decimal to octal, decimal to hexadecimal, etc. • Representation of a number in a system with base (radix) N may only consist of digits that are less than N. • The base or radix of these number systems depends on the number of digit present in each number system. • The binary system contains 0 and 1, so its base is 2. The decimal base is 10 and the hexadecimal base is 16.

8. Binary to Decimal: • Conversion from binary to decimal using decimal arithmetic is accomplished by simply summing the powers of 2 corresponding to the powers of 1 in the binary number.

9. Decimal to Binary: • Conversion from decimal to binary using decimal arithmetic is accomplished by repeated division of the decimal number by two. After each division the remainder is the next bit of the binary number starting from the least significant.

10. Numer System Conversions:

11. Numer System Conversions:

12. Table 13-2 Conversion of decimal to hexadecimal to octal to binary:

13. BOOLEAN ALGEBRA: • The working principle of the digital circuit is guided by Boolean algebra. Boolean algebra functions through addition, subtraction and its five basic laws. • 1. Addition: Boolean addition uses the addition process with binary numbers—0’s and 1’s. Various combinations of binary addition are shown in Table 13-3. The general form of addition of two binary numbers, say A and B produce a sum (S ) and a carry (Cy) as shown here.

14. Procedure of Binary Addition:

15. Procedure of Binary Addition:

16. Procedure of Binary Subtraction: • Boolean subtraction binary numbers—0’s and 1’s, is shown in Table 13-4. The general form of subtraction of two binary numbers A and B produce a difference (D) and a borrow, as shown here.

17. Example of Binary Subtraction:

18. Basic Boolean Laws: • Every law has two expressions—(a) and (b). This is known as duality. These are obtained by changing every AND (.) to OR (); every OR () to AND (.); and all 1’s to 0’s and vice-versa. • It has become conventional to drop (.)—the AND symbol, i.e., A.B is written as AB. Some of the very important laws are as follows:

19. LOGIC GATES: • The basic elements of digital circuits are logic gates. Logic circuits are generally designed with BJT, FET and CMOS circuits having many inputs and a single output. • The output will be either logic high (1) or logic low (0) depending on the combination of input logic high and low. • The functional behaviour of a logic gate is realized by the three processes, as explained in the following sections. • 1. Truth Table: Truth table is a prescribed specification table that explains the input-output relation for all possible combination of inputs. • 2. Logic Equation: In logic equations, the output is expressed in terms of input according to the truth table. Logic equations are generally unique as truth tables vary from logic to logic. • 3. Timing Diagram: Timing diagram of a logic gate indicates the variation of the output waveform with respect to the input waveform. It is a pictorial representation of the time-varying input and output of the logic gate.

20. AND Gate: • The AND gate has two or more inputs. Its output is logic high (1) only when both the inputs are at logic high (1). • The truth table of an AND gate is shown in Table 13-5 and logic symbol is shown in Fig. 13-1

21. OR Gate: • The OR gate is a two or more input logic gate. Its output is logic high (1) if any of the inputs are high (1). The truth table of an OR gate is shown in Table 13-6 and logic symbol is shown in Fig. 13-2.

22. NOT Gate: • The NOT gate is a single input and single output gate, which performs a basic logical inversion/complementation 0peration. The truth table of a NOT gate is shown in Table 13-7 and the logic symbol is shown in Fig. 13-3.

23. NAND Gate: • The NAND gate is a two or more input logic gate. Its output is logic low (0) only when both the inputs are at logic (1). The truth table of a NAND gate is shown in Table 13-8 and logic symbol is shown in Fig. 13-4.

24. NOR Gate: • The NOR gate is a two or more input logic gate. Its output is logic high (1) both the inputs are at logic low (0). The truth table of a NOR gate is shown in the Table 13-9 and the logic symbol is shown in Fig. 13-5.

25. XOR Gate: • XOR gate is a two or more input logic gate. Its output is logic high (1) if only one of the input is at logic high. The truth table of a XOR gate is shown in Table 13-10 and the logic symbol is shown in Fig. 13-6.

26. XNOR Gate: • XNOR gate is a two or more input logic gate. Its output is logic high (1) if both the inputs are either logic high or logic low. The truth table of XNOR gate is shown in Table 13-11 and the logic symbol is shown in Fig. 13-7.

27. Universal Gate: • NAND and NOR gates are called universal, as all the basic logic AND, OR and NOT gates can be designed/realized through a combination of NAND/NOR. • The design of AND, OR and NOT gates using NAND and NOR gates is shown in Figs. 13-8 and 13-9 respectively.

28. Universal Gate:

29. Characteristics of Logic Gates: • The characteristic features of logic gates are as follows: • Fan-out: • The measure of the maximum number of logic gates that can be driven by a single logic gate without affecting the specified operational characteristics of the driving gate is called fan-out. A standard fan-out for TTL is ten (10). • Fan-in: • The measure of the maximum possible number of inputs that can be connected to a logic gate without affecting the specified operational characteristics of the driven logic gate is called fan-in. A standard fan-in for TTL is ten (10).

30. Characteristics of Logic Gates: • Propagation delay: • The time taken by an input signal to pass through a logic gate and emerge from the output is known as propagation delay. A typical delay time for a TTL logic gate is 30 nsec. • Power dissipation: • The power consumed by a logic gate is known as power dissipation. • Noise: • The unwanted input signal in a logic gate is known as noise. • Noise margin: • The maximum level of noise voltage allowed at the input without affecting the output is the noise margin.

31. DE MORGAN’S THEOREM: • De Morgan developed a pair of important rules concerning group complementation in Boolean algebra. • Through group complementation, the complement of the logical sum of a number of binary variables is equal to the logical product of the complements of all the individual variables. For all elements A and B of the set S: • Using Basic Logic Gate:

32. Using Logic Gate:

33. Using Logic Gate:

34. Application of De Morgan’s Theorem: • This theorem is used for the simplification of Boolean expressions in a simplest and smallest form of equivalent circuit. • De Morgan’s theorem describes the equality between gates with inverted inputs and gates with inverted outputs. • For example, a NAND gate is equivalent to a negative OR gate, and a NOR gate is equivalent to a negative AND gate. When “breaking” a complementation bar in a Boolean expression, the operation directly underneath the break reverses, and the broken bar pieces remain over the respective terms. • Complementation bars function as grouping symbols. So, when a bar is broken, the terms underneath it must remain grouped.

35. SIMPLIFICATION OF BOOLEAN EXPRESSION: • Simplification of Boolean expressions can be done by the algebraic method or by the Karnough Map method. • Karnough Map is one of the simplest methods of solving the four variable algebraic equations.

36. SIMPLIFICATION OF BOOLEAN EXPRESSION:

37. SIMPLIFICATION OF BOOLEAN EXPRESSION:

38. SIMPLIFICATION OF BOOLEAN EXPRESSION:

39. LOGIC GATE CIRCUITS: • Logic gate circuits are divided into two categories based on whether they are with feedback sequential logic circuit or without feedback combinational logic circuit. • Thus, digital electronics is classified into combinational logic and sequential logic. • Combinational logic output depends on the inputs levels, whereas Sequential logic output depends on stored levels of past data and also the present input levels. • Combinational logic circuit is used to realize different logic functions using different basic logic gates.

40. Combinational logic circuit: • Combinational logic circuit is used to realize different logic functions using different basic logic gates. • Adder: Adder is a combinational logic circuit is used to add two or more bits. • Half adder: Half adder is a combinational logic circuit, which is used to add two bits and generate output as sum ( S ) and carry ( Cy ). • Full adder: Full adder is a combinational logic circuit used to add three or more bits. The reason for the name full adder is that it can add the carry bit as third bit (Cin ) along with other two inputs A and B.

41. Half adder: • Half adder: The truth table of half adder is shown in Table 13-12 and the circuit diagram is shown in Fig. 13-12.

42. Full adder: • Full adder: The truth table of full adder is shown in the Table 13-13 and circuit diagram is shown in Fig. 13-13. • The full adder takes three inputs. The two inputs A and B are the two bits to be added while the third input is the carry from the previous lower significant position. • A full adder can be constructed from two half adders by connecting A and B to the input of one half adder, connecting the sum from that to an input to the second adder, connecting Cin to the other input and OR the two carry outputs.

43. Full adder:

44. Multiplexer: • Multiplexer means “path selector”; it has many inputs, a single output and select input signals. A multiplexer has n number of select inputs, 2n, inputs, and only one output.

45. Multiplexer: • A 4-to-1 multiplexer can be implemented by using two inverters, four AND gates and a 4-input OR gate. To each of the AND gates any of the data input lines and the corresponding select lines are applied, and the output of all the AND gates are applied, to the OR gate to get the output.

46. De-multiplexer: • De-multiplexer operation is the opposite to that of the multiplexer. It has n number of select inputs, 2n outputs and only one select input. • The truth table of de-multiplexer is shown in Table 13-15 and the block diagram is shown in Fig. 13-16. The circuit diagram is shown in Fig. 13-17.

47. De-multiplexer: • A 1-to-4 de-multiplexer can be implemented by two inverters and four 3-input AND gates. The single input D is applied to all the AND gates. The two select lines S1, S0 enable any one AND gate at a time and the data appears at the output of the selected AND gate as shown in Fig. 13-17.

48. Encoder: • An encoder is a combinational logic circuit which converts non-digital data to digital data. • An encoder has 2n input lines and n output lines. The output lines generate a binary code corresponding to the input value. • For example a single bit 4-to-2 encoder takes in 4 bits and outputs 2 bits. An encoder combinational circuit that performs the inverse operation of a decoder. The truth table of an encoder is shown in Table 13-16

49. Encoder:

50. Decoder: • Decoder is combinational logic circuit multiple-input, multiple-output logic circuit which converts digital data to non-digital data. • A 3-to-8 decoder is implemented using three inverters and eight 3-input AND gates, as shown in Fig. 13-21. The three inputs A, B, C are decoded into eight outputs. Each one of the AND gates produce one minterms of the input variables.