COMBINATIONAL LOGIC CIRCUIT First Class. Dr. AMMAR ABDUL-HAMED KHADER

Size: px

Start display at page:

Download "COMBINATIONAL LOGIC CIRCUIT First Class. Dr. AMMAR ABDUL-HAMED KHADER"

Juliana Owen
6 years ago
Views:

1 COMBINATIONAL LOGIC CIRCUIT First Class 1

2 BASIC ADDER Adders are important in computers and also in other types of digital system in which numerical data are processed. An understanding of the basic operation is fundamental to the study of digital system. There are two types of adder: Half-Adder Full-Adder 2

3 Adder S= ABC + ABC + ABC + ABC =A(B + C)+A(B +C) = A+ B +C 3

4 Adder 4

5 Half-Adder Recall the basic rules for binary addition: = = = = 10 The operation are performed by a logic circuit called a Half-Adder. It accepts two binary digits on its inputs and produces two binary digits on its outputs, a sum bit and a carry bit. INPUT A Sum B Carry OUTPUT 5

6 The Half-Adder We can observe that the sum is 1 only if the inputs are not equal. Therefore the sum can be expressed as the exclusive OR of the input variables. 6

The difference between Full & Half-Adder is that the fulladder

7 The full-adder accept two input bits and an input carry and generates a sum output and an output carry. The difference between Full & Half-Adder is that the fulladder accepts an input carry. The Full-Adder INPUT A Sum OUTPUT Carry B Cin Cout output carry 7

8 The Full-Adder After A exclusive-or with B, Cin must be exclusive-ored with their result. This means, that to implement the full-adder sum function, two 2-inputs exclusive-or gates can be used Gates required for one Full-Adder A B Cin A + B A + B + Cin Gates required for Two Half- Adder to complete one Full-Adder A B Cin A + B A + B + Cin (A + B) Cin AB (A + B) Cin A B 8

9 The Full-Adder The full adder circuit can be constructed from two half adder circuits as shown 9

10 The Full-Adder Pi = Ai Bi Gi = AiBi sum Si = Pi Ci carry Ci+1 = Gi + PiCi 10

11 The Full-Adder Example: Determine the output for this full-adder: Solution: A (X-OR) B (X-OR) Cin = = 0 with a carry of 1 11

12 Parallel Binary Adder Two or more full-adder are connected to form parallel binary adder. To add two binary numbers, a full-adder is required for each bit in the numbers. So for 2-bit numbers, two adders are needed; for 4-bit numbers, four adder are used and so on. 12

13 Parallel Binary Adder Example: Determine the sum generated by the 3-bit parallel adder, and show the intermediate carriers when the binary numbers 101 and 011 are being added

14 Parallel Binary Adder Example: Determine the sum generated by the 4-bit parallel adder, 1011 Ai, 0011 Bi, Solution: 0110 Ci, 1110 Si, 0011 Ci

15 4-Bit Parallel Adder The 74LS283 IC (Integrated Circuit) is an example of 4-bit parallel adder. The pin diagram and logic symbol for this IC is shown below. Pin diagram Logic symbol 15

16 Adder Expanding Cascading of four 4-bit adders to form a 16-bit adder 16

17 Adder Expanding Example: Show how two 74LS283 adders can be connected to form an 8-bit parallel adders. Show output bits for the following 8-bit input numbers. A8..A1 = and B8.B1= Solution: The only connection between the two ICs is the carry output (pin9) of the lower order to the carry input (pin7) of the high-order adder, pin7 of the lower-order adder is grounded (no carry input). The total sum is:

Adder Expanding A1 1 A2 0 A3 0 A4 1 B1 0 B2 1 B3 1 B4

18 Adder Expanding A1 1 A2 0 A3 0 A4 1 B1 0 B2 1 B3 1 B A5 1 A6 1 A7 0 A7 1 B5 1 B6 0 B7 0 B

19 Subtractors The subtraction of two binary numbers may be accomplished by taking the complement of the subtrahend and adding it to the minuend. By this method, the subtraction operation becomes an addition operation requiring full adders for its machine implementation. It is possible to implement subtraction with logic circuits in a direct manner. By this method, each subtrahend bit of the number is subtracted from its corresponding significant minuend bit to form a different bit. If the minuend bit is smaller than the subtrahend bit, a 1 is borrowed from the next significant position. The fact that a 1 has been borrowed must be conveyed to the next higher pair of bits by means of a binary signal coming out (output) of a given stage and going into (input) the next higher stage. 19

20 Subtractors Example: Subtract the decimal number (78) from (123) 123 (A) or X (Minuend) 78 (B) or Y (Subtrahend) 45 DIFFERENCE 20

21 Half Subtractor The half-subtractor B0=AB is a combinational D=A + B circuit which is used to perform subtraction of two bits. It has two inputs, A (minuend) and B (subtrahend) and two outputs D (difference) and B (borrow). AB+AB AB B0=AB D=A + B 21

22 Full Subtractor The full-subtractor is a combinational circuit which is used to perform subtraction of three bits. It has three inputs, A (minuend) and B (subtrahend) and C (subtrahend) and two outputs D (difference) and B (borrow) AC + AB + BC 22

23 Adder-Subtractor 4-Bit Adder Subtractor M=0, the circuit is an adder (B 0 = B) M=1, the circuit is a subtractor (B 1 = B, C0=1) 23

24 Decimal Adder Can be designed from 2 4-bit adder and external gates. So the two binary numbers are added normally with external circuit that generates the carry bit C when K+Z8Z4+Z8Z2 =1. When Binary sum is greater than 9 a correction factor=(0110)b should be added i.e. under the condition that Output carry =1 BCD adder block diagram 24

Experiment # 3 Combinational Circuits (I) Binary Addition and Subtraction

Experiment # 3 Combinational Circuits (I) Binary Addition and Subtraction Objectives: 1. To study adder and subtractor circuits using logic gates. 2. To construct and test various adders and subtractor