1 / 12

ECE 301 – Digital Electronics

This lecture covers the concepts of half adders and full adders in digital electronics, including their truth tables, Boolean expressions, and circuit diagrams. Designing a full adder hierarchically using two half adders and an OR gate is also discussed.

smatthew
Download Presentation

ECE 301 – Digital Electronics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Single-bit Adder Circuits (Lecture #12) ECE 301 – Digital Electronics The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6th Edition, by Roth and Kinney, and were used with permission from Cengage Learning.

  2. ECE 301 - Digital Electronics The Half Adder (HA)

  3. ECE 301 - Digital Electronics 0 0 1 1 + 0 + 1 + 0 + 1 0 1 1 10 Sum Carry Sum The Half Adder

  4. ECE 301 - Digital Electronics The Half Adder Truth Table

  5. ECE 301 - Digital Electronics Given the truth table on the previous slide, 1. Derive the Boolean expressions for the sum and carry. 2. Draw the corresponding circuit diagram. The Half Adder

  6. ECE 301 - Digital Electronics The Full Adder (FA)

  7. ECE 301 - Digital Electronics The Full Adder 0 0 0 0 0 0 1 1 + 0 + 1 + 0 + 1 0 1 1 10 Carry-in 1 1 1 1 0 0 1 1 + 0 + 1 + 0 + 1 1 10 10 11 Carry-out Sum

  8. ECE 301 - Digital Electronics The Full Adder Truth Table

  9. ECE 301 - Digital Electronics Given the truth table on the previous slide, 1. Derive the Boolean expressions for the sum and carry-out. 2. Draw the corresponding circuit diagram. The Full Adder

  10. ECE 301 - Digital Electronics Design the Full Adder hierarchically, using 2 Half Adders 1 OR gate The Full Adder

  11. ECE 301 - Digital Electronics The Full Adder Half Adder (ha2) Cin Sum B A Cout Half Adder (ha1)

  12. ECE 301 - Digital Electronics Questions?

More Related