1 / 1

We assume both adders are implemented with carry ripple adders. Every signal in

HA2. 1/2. a. Given is the following circuit. The input a is added in the first adder and subsequently in the second adder after multiplication by ½. 4. s. +. +. 4. We assume both adders are implemented with carry ripple adders. Every signal in

sabine
Download Presentation

We assume both adders are implemented with carry ripple adders. Every signal in

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. HA2 1/2 a Given is the following circuit. The input a is added in the first adder and subsequently in the second adder after multiplication by ½. 4 s + + 4 We assume both adders are implemented with carry ripple adders. Every signal in this example contains 4 bits and  represents the delay of the carry of the full adder. The delay of the sum output equals 2. 1. Draw a bitlevel representation of this circuit. 2. How long is the critical path ? 3. What is the smallest possible critical path that can be be obtained by pipelining or retiming ? What is the minimal number of flipflops ? 4. Can this circuit be speeded up by transformations ? How long is the critical path ? What is the minimal number of flipflops ? jvm

More Related