Scribd
Upload
18 views39 pages

Basic Gates

Uploaded by

peepa Pradeep
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views39 pages

Basic Gates

Uploaded by

peepa Pradeep
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 39

Basic Gates

Logic Levels
Basic Gates : AND, OR and NOT
Universal Gates
• NAND ( AND followed by NOT)
NOR gate
• NOR ( OR followed by NOT)
Basic Theorems and Properties
of
Boolean Algebra
Write the Truth table and timing
diagram
a b c f g
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Write the Truth table and timing
diagram
Write the timing diagram

0 1 0 1 0 1 0 1

0 0 1 1 0 0 1 1

0 0 0 0 1 1 1 1

1 1 1 1 1 1 1
Write the timing diagram
Postulates and Theorems of
Boolean Algebra
Draw the logic diagram
Simplify the following Boolean expressions to a minimum number of
literals:
• xy + xy'
• (x + y) (x + y')
• xyz + x'y + xyz'
• (A + B) ' (A' + B') '
• (a+ b + c')(a' b' +c)
• a'bc + abc' + abc + a'bc'
Simply the boolean expression using
K map
• Simply the boolean expression using K map
• F(x,y,z) = Σ m(3,4,6,7)
• F(x,y,z) = Σ m(0,2,4,5,6)
• F(x,y,z) = Σ m(1,2,3,5,7)
• F(w,x,y,z) = Σ m(0,1,2,4,5,6,8,9,12,13,14)

• F(A,B,C) = A’B’C’ = B’CD’ + A’BCD’ + AB’C’ = B’D’ + B’C’ + A’CD’


Simply the boolean expression using
K map
• Simply the boolean expression using K map
• F(x,y,z) = Σ m(3,4,6,7) = xz’ + yz
• F(x,y,z) = Σ m(0,2,4,5,6) = xy’ + z
• F(x,y,z) = Σ m(1,2,3,5,7) = A’B + C
• F(w,x,y,z) = Σ m(0,1,2,4,5,6,8,9,12,13,14) = xz’ + w’z’ + y’

• F(A,B,C) = A’B’C’ = B’CD’ + A’BCD’ + AB’C’ = B’D’ + B’C’ + A’CD’


Don’t cares
• F(w,x,y,z) = Σ(1,3,7,11,15) + d Σ(0,2,5)

f=yz + w'x' f=yz + w’z


Prime and Essential prime
implicant
• Prime Implicant: A prime implicant is a product term obtained by
combining the maximum possible number of adjacent squares in the
map.

• If a minterm is a square is covered by only one prime implicant, that


prime implicant is said to be essential prime implicant.

• The prime implicant of a function can be obtained from the k-map by


combining all possible maximum number of squares.
Find prime and essential prime
implicant
F(A,B,C,D) = Σ m(0,2,3,5,7,8,9,10,11,13,15)

Essential prime implicant BD and B’D’

Partial K - map
Prime implicants : CD, B’C, AD and AB’

K – map excluding essential prime implicant


F(A,B,C,D) = Σ m(0,2,3,5,7,8,9,10,11,13,15) : BD + B’D’ + CD + B’C + AD + AB’
Basic gates using NAND gate
Implement using NAND gates
only
• F = AB + CD

F = ( (AB)' (CD)' )’ = AB + CD
Implement f(x, y, z) = m(1,2,3,4,5,7) using
NANG gates only
F(x,y,z)= m(1,2,3,4,5,7)
Implement f(x, y, z) = m(1,2,3,4,5,7) using
NANG gates only
F(x,y,z)= m(1,2,3,4,5,7)

F(x,y,z)= xy’ + x’y + z


F(x,y,z)= m(1,2,3,4,5,7)
= xy’ + x’y + z
Basic gates using NOR gates
Implement using NOR gates only
• F = (A+B) (C + D) E
f=(AB'+A'B)(C+D') with NOR gates
Gray code : Every successive pair of numbers differs in only one bit
Input Output
A B C D W X Y Z
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0
Multiplexer

Truth Table
S1 S0 Y
0 0 I0
0 1 I1
1 0 I2
1 1 I3
4 to 1 Mux

Y = S2’S1'S0’ I0 +S2’ S1’S0 I2 + S2’S1S0’ I2 + S2’S1S0 I3


Y = S1'S0'I0 + S1'S0I2 + S1S0'I2 + S1S0I3 + S2S1’S0’ I4 +S2 S1’S0 I5 + S2S1S0’ I6 + S2S1S0 I7
Multiplexer

4 to 1 multiplexer 8 to 1 multiplexer
Implement using Mux
F (A, B, C) = (1,2,4,7)
Implement using Mux
F (A, B, C) = (1,2,4,7)
S2 S1 S0 F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
Implement using Mux
F (A, B, C, D) = (1, 3, 4, 11, 12, 13, 14, 15)
Using two 8 to 1 mux and basic gates
Implement using Mux
F (A, B, C, D) = (1, 3, 4, 11, 12, 13, 14, 15)
Using two 8 to 1 mux and basic gates
F (A, B, C, D) = (1, 3, 4, 11, 12, 13, 14, 15)
using single 4 to 1 mux
F (A, B, C, D) = (1, 3, 4, 11, 12, 13, 14, 15)
using single 4 to 1 mux
Decoder

You might also like