Logic Gates n Logic gates are electronic digital

Logic Gates n Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding logic circuits in Integrated Circuit (I. C. ) form.

Design of Circuit Procedures 1. 2. 3. 4. 5. 6. 7. 8. 9. Obtain a precise circuit specification Development of a truth table Identifying the minterms corresponding to each row in the table. Drawing Karnaugh maps Forming groups of 1's on the Karnough map Writing the reduced expression Converting the reduced expression into a realizable expression Drawing the circuit diagram Construct and test a prototype circuit.

Types of Logic Gates

Basic Gates AND , OR , NOT

AND Gate n n The AND gate implements the Boolean AND function where the output only is logical 1 when all inputs are logical 1. The standard symbol and the truth tabel for a two input AND gate is:

Boolean expression of AND The Boolean expression for the AND gate is R=A. B A 0 0 1 1 B 0 1 R 0 0 0 1

OR Gate n n The OR gate implements the Boolean OR function where the output is logical 1 when just input is logical 1. The standard symbol and the truth table for a two input OR gate is:

Boolean Expression of OR The Boolean expression for the OR gate is: R=A+B A 0 0 1 1 B 0 1 R 0 1 1 1

NOT Gate n n The NOT gate implements the Boolean NOT function where the output is the inverse of the input. The standard symbol and the truth table for the NOT gate is:

Boolean Expression of NOT n The Boolean expression for the NOT gate is: R=-A A R 0 1 0 0

Derived Gates NAND , NOR , XOR

NAND Gate n n The NAND gate is an AND gate followed by a NOT gate. The output is logical 1 when one of the inputs are logical 0 The standard symbol and the truth table for the NAND gate is:

Boolean expression of NAND A 0 0 1 1 B 0 1 R 1 1 1 0

NOR Gate n n The NOR is a combination of an OR followed by a NOT gate. The output is logical 1 when non of the inputs are logical 0 The standard symbol and the truth table for the NOR gate is:

Boolean Expression of NOR A 0 0 1 1 B 0 1 R 1 0 0 0

XOR Gate n n The XOR gate produces a logic 1 output only if its two inputs are different. If the inputs are the same, the output is a logic 0 The XOR symbol is a variation on the standard OR symbol. It consists of a plus (+) sign with a circle around it. The logic symbol, as shown here, is a variation on the standard OR symbol.

Exercise 1 http: //kom. auc. dk/logic/

De-Morgan’s Theorem and Logic Conversion 1) 2) 3) 4)

Implement the logic expression using NAND gates only 1) 2)

Implement logic expression using NOR gates only 1)

Revision Exercise n n http: //www. nottingham. ac. uk/~cczwoo d/Test. Courses/logic-intro. html http: //www. cs. odu. edu/~jbollen/CS 149/ demos. html http: //sandbox. mc. edu/~bennet/cs 110/ boolalg/gate. html http: //www. cs. stedwards. edu/~jsnowde /start. htm

Combinational Logic Designs n I 1 In n A combinational logic circuit can be described by the block schematic shown : : Combinational Logic : : O 1 On Each output is a function of some or all of the input variables, Hence O 1=f(I 1, I 2, . . , In) O 2=f(I 1, I 2, …, In). . . and On=f(I 1, I 2, …, In)

Half Adder

What is a Half adder? n n Logic gate that perform addition for 1 bit When 1 + 1 occurs, a carry produce 1

Half Adder n n n Perform arithmetic additions two inputs A, B to half-adder. Resultants are Sum(S) and Carry(Cout) A S H. A B Cout Using K-Map to simplify the sum term, we get

Full Adder

What is Full Adder? n n n A full adder is a circuit that computes the sum of three bits and gives a two-bit answer. A circuit for adding two 16 -bit numbers can be built from 16 full-adder circuits. Each fulladder does one column of the sum. The full adder for a given column adds two bits from the input numbers together with a one-bit carry from the previous column to the right. The adder produces a two-bit answer; one of these bits is used as a carry into the next column.

Full Adder n n A full adder has 3 inputs and 2 outputs The truth table of the full-adder can be drawn with inputs A, B and Cin with outputs S and Cout From the truth table we can write the Boolean equation for the S and Cout Simplify using Boolean Algebra and K-map, we get

Sum = Any 2 of the three inputs are 1 Cout = XOR between A, B, Cin A 0 0 1 1 B 0 0 1 1 0 0 Cin 0 1 0 1 Sum 0 0 0 1 Cout 0 1 1 0 1 1 1 0 1

Full Adder diagram

Half Subtractor

What is a Half Subtractor n n A logic gate that perform 1 bit subtraction When 0 -1 occurs, a carry produces 1

Half Subtractor A 0 B 0 D 0 0 0 1 1 0 1 0 1 1 0 A 0 B 0 C 1 0 0 1 2 0 -1 1 D 0 C 1

Half Subtractor n Operation: A - B

Full Subtractor

What is a Full Subtraction? n Logic gates that perform two bits subtraction

Full Subtractor Ci Ai Bi Di Ci+1 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1 Ai B i 00 Ci 11 1 01 10 1 1 1 Di Di = Ci $ (Ai $ Bi) Same as Si in full adder

Full Subtractor Ci Ai Bi Di Ci+1 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1 Ai B i 00 Ci 11 10 1 01 1 Ci+1 = !Ai & Bi # Ci & !Ai & !Bi # Ci & A i & B i

Full Subtractor Ci+1 = !Ai & Bi # Ci & !Ai & !Bi # Ci & A i & B i Ci+1 = !Ai & Bi # Ci & (!Ai & !Bi # Ai & Bi) Ci+1 = !Ai & Bi # Ci & !(Ai $ Bi) Recall: Di = Ci $ (Ai $ Bi) Ci+1 = !Ai & Bi # Ci & !(Ai $ Bi)

Full Subtractor Di = Ci $ (Ai $ Bi) Ci+1 = !Ai & Bi # Ci & !(Ai $ Bi) half subtractor

Full Subtractor n Operation: A - Bin

Adder/Subtractor - 1 A 0 B 0 S 0 C 1 Half adder E = 0: Half adder E = 1: Half subtractor A 0 B 0 D 0 C 1 Half subtractor

Adder/Subtractor-1 Ci Di Ai Bi Ci+1 E E = 0: Full adder E = 1: Full subtractor

Full Adder Reordered Full Adder Full Subtractor Ci Ai Bi Si Ci+1 Ci Ai Bi Di Ci+1 0 0 1 1 1 1 0 0 0 0 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 0 1 0 0 1 1 0 0 1 0 NOT 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1

Making a full subtractor from a full adder

Four-Bit Parallel Adder n n n This circuit is sometimes referred to as a ripplethrough adder C 0 ripples through four two-level logic circuits and hence the sum cannot be completed until eight gate delays For this kind of adder, the maximum delay is directly proportional to the number of stages n.

Adder/Subtractor-2 E = 0: 4 -bit adder E = 1: 4 -bit subtractor

Carry Look-Ahead Circuit n To improve the speed of addition n Consider the carry output equation for a full adder is n Which can be expressed as follows n or as n where

Carry Look-Ahead Circuit n n Four a four-bit adder the generate and propagate terms for each stage are while the carries for the various stages are

Carry Look-Ahead Circuit n n n Substituting for C 0 in the C 1 equation etc leads to the following equations: And the sum Since the number of levels of logic required when a large number of bits has to be added does not increase then the Carry Look-Ahead adder will provide a faster addition time

Binary Multiplication n n Paper and Pen method which is implemented using 9 AND gates, 3 FA and 3 HA