1 / 15

מבנה המחשב - מבוא למחשבים ספרתיים

מבנה המחשב - מבוא למחשבים ספרתיים. תרגול מספר 6. U-PENCs, B-PENCs & Half Decoders. U-PENC Design. Correctness of U-PENC Design. Induction base:. Correctness of U-PENC Design (2). Correctness of U-PENC Design (3). Extending the U-PENC design for all values of n. Why divide?

lel
Download Presentation

מבנה המחשב - מבוא למחשבים ספרתיים

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. מבנה המחשב - מבוא למחשבים ספרתיים תרגול מספר 6 U-PENCs, B-PENCs & Half Decoders

  2. U-PENC Design

  3. Correctness of U-PENC Design Induction base:

  4. Correctness of U-PENC Design (2)

  5. Correctness of U-PENC Design (3)

  6. Extending the U-PENC design for all values of n Why divide? Why is it not a good idea to set k=const?

  7. Delay Analysis of the U-PENC

  8. Cost Analysis of the U-PENC Is it optimal?

  9. U-PENC Cost – Lower Bound Why is this is the best lower bound we can make?

  10. Building a non-optimalHalf-Decoder from existing blocks x[0:n-1] Decoder (n) 2n U-PENC (2n) 2n Bitwise-NOT (2n) y[0:2n-1]

  11. Half-Decoder Cost – Lower Bound

  12. Half-Decoder Cost – Lower Bound (2)

  13. Half-Decoder Cost –Lower Bound (3)

  14. Half-Decoder Cost – Lower Bound (4)

  15. Cost of a B-PENC(n) - Solving the Recursion

More Related