Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Digital

310 views

Published on

Published in: Education
  • Be the first to comment

  • Be the first to like this

Digital

  1. 1. 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
  2. 2. AND-OR-INVERT IMPLEMENTATION <ul><li>The two forms NAND-AND and AND-NOR are equivalent forms and can be treated together </li></ul>
  3. 3. AND-OR-INVERT implementation <ul><li>The tow forms NAND-AND and AND-NOR are equivalent forms and can be treated together. Both perform the AND-OR-INVERT function </li></ul>
  4. 4. NOR implementation <ul><li>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. </li></ul><ul><li>F =(A+B) (C+D)E </li></ul>
  5. 5. Convert binary to decimal <ul><li>110.001 =? </li></ul><ul><li>Answer = 6.125 </li></ul><ul><li>1011.10 = </li></ul><ul><li>Answer = 11.5 </li></ul><ul><li>110101 = ? </li></ul><ul><li>Answer = 53 </li></ul>
  6. 6. Convert binary to hexadecimal <ul><li>01111101=? </li></ul><ul><li>Answer =7d </li></ul><ul><li>110101.0101011=? </li></ul><ul><li>Answer =35.56 </li></ul>
  7. 7. Convert binary to octal <ul><li>0110100=? </li></ul><ul><li>Answer = 064 </li></ul><ul><li>101100=? </li></ul><ul><li>Answer = 766 </li></ul>

×