1. מבנה המחשב - מבוא למחשבים ספרתיים U-PENCs, B-PENCs & Half Decoders תרגול מספר 6

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-optimal Half-Decoder from existing blocks U-PENC (2 n ) Bitwise-NOT (2 n ) Decoder (n) y[0:2 n -1] 2n2n 2n2n x[0:n-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