Like this presentation? Why not share!

Digital

by Venkat Raman, Working at Student on May 05, 2011

• 276 views

Views

Total Views
276
Views on SlideShare
276
Embed Views
0

Likes
0
0
0

No embeds

Categories

Uploaded via SlideShare as Microsoft PowerPoint

DigitalPresentation Transcript

• NAND Implementation The implementation of a Boolean function with NAND gates requires that the function be simplified in the sum-of-products form. Consider the Boolean function F = AB + CD + E
• AND-OR-INVERT IMPLEMENTATION
• The two forms NAND-AND and AND-NOR are equivalent forms and can be treated together
• AND-OR-INVERT implementation
• The tow forms NAND-AND and AND-NOR are equivalent forms and can be treated together. Both perform the AND-OR-INVERT function
• NOR implementation
• The implementation of a Boolean function with NOR gates requires that the function be simplified in the product-of-sum (pos) form. A product-of-sums expression specifies a group of OR gates for the sum terms. Following by an AND gate to produce the product.
• F =(A+B) (C+D)E
• Convert binary to decimal
• 110.001 =?
• 1011.10 =