1 / 10

7-Segment

7-Segment. Introduction to the 1 st theoretic Exercise. 7 segment – Decimal Digit. When building a digital clock, we’ll probably want to use a 7-segment electrical digit as “GUI”. How does each segment know when to be turned on?. 7 Segment – Decimal Digit.

hubert
Download Presentation

7-Segment

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. 7-Segment Introduction to the 1st theoretic Exercise

  2. 7 segment – Decimal Digit • When building a digital clock, we’ll probably want to use a 7-segment electrical digit as “GUI”. • How does each segment know when to be turned on? תירגול 2 - מבנה מחשב

  3. 7 Segment – Decimal Digit • The range is 0..9, and since the number of states is 10, we only need 4 bits. • In general, in order to represent n states, we’ll need bits. תירגול 2 - מבנה מחשב

  4. Segment f Example • Segment f is on in digits0, 4, 5, 6, 8, 9. • We’ll build its truth table. תירגול 2 - מבנה מחשב

  5. Segment f Example (2) תירגול 2 - מבנה מחשב

  6. Segment f Example (3) • Solution 1: Karnaugh map representation and simplification • Solution 2:Extract DNF, arithmetic simplification תירגול 2 - מבנה מחשב

  7. Segment f Example - Karnaugh 00 01 11 10 00 01 11 10 תירגול 2 - מבנה מחשב

  8. 0 0 Segment f Example - DNF (1) • Ideally we would add to the DNF the beneficial values for the X lines • In practice we will take all X as 0 (for your benefit) תירגול 2 - מבנה מחשב

  9. Segment f Example - DNF (2) 00 01 11 10 • Not taking the X lines at there “ideal” values yields a less efficient result • Using the same truth table will yield the following Karnaugh map 00 01 11 10 תירגול 2 - מבנה מחשב

  10. Homework (Theoretical 1) • In the following instructions use the above digital representation. • Perform segment a using arithmetic logical simplification (DNF with 0 instead of x) • Solve segments b-g using Karnaugh Maps • Draw the graphical representation for segment b. • notice that only 1 line is allowed to exit a gate ! • Use the “full dot” to symbol a branch in a line • Use the “empty dot” to symbol a NOT on an exit • Use only AND, OR and NOT gates • Submit the papers to your TA’s Mail Box (Tom 42 // Orgad 7) CLEARLY (!) write your tirgul Number on the first page • Deadlines: • Groups 03, 04 – 13.11 and 14.11 respectively. • Groups 05, 06 – 9.11 and 11.11 respectively. תירגול 2 - מבנה מחשב

More Related