Академический Документы
Профессиональный Документы
Культура Документы
Table of contents
Shivrath Yandra Page 1
1. Introduction
Shivrath Yandra Page 2
Adders are of fundamental importance in a wide variety of digital systems. Many fast adders exist, but adding fast using low area and power is still challenging. The importance of a fast, low-cost binary adder in a digital system is difficult to overestimate. Not only are adders used in every arithmetic operation, they are also needed for computing the physical address in virtually every memory fetch operation in most modern CPUs. Adders are also used in many other digital systems including telecommunications systems in places where a full-fledged CPU would be superfluous. Many styles of adders exist. Ripple adders are the smallest but also the slowest. More recently, carry-skip adders, Carry-look-ahead and carry-select adders are very fast but far larger and consume much more power than ripple or carry-skip adders. The images below summarize the design and implementation of the Carry Look Ahead Adder CLA, which could be used to sum the partial products of the booth multiplier in the future. All simulations performed with Cadence IBM 90. Testing done to verify the functionality. Techniques used to improve speed performance from the gate level implementation include use of a transmission gate full adder and a CMOS implementation of the CLA logic. The worst case delay time of the test cases was reduced using these techniques. The following sections summarize the hierarchy of the Carry Look Ahead Adder.
Shivrath Yandra
Page 3
These two signals can be used to generate the carry out bit simultaneously for faster addition (see 4-bit Carry Look ahead Adder). Figure shows a gate level implementation of the full adder schematic. Note that ~G is also generated. This bit can be used instead of G to simplify some of carry look ahead logic. Figure 20 shows a symbol view of the full adder. The simulation output can be seen in Figure. All possible inputs were swept, and all outputs were correct. There is a average of propagation delay from input to sum.
Figure Simulation
Shivrath Yandra
Page 7
Shivrath Yandra
Page 8
Shivrath Yandra
Page 9
Shivrath Yandra
Page 10
Shivrath Yandra
Page 11
Shivrath Yandra
Page 12
Shivrath Yandra
Page 13
Shivrath Yandra
Page 14
Shivrath Yandra
Page 15
Shivrath Yandra
Page 16
Shivrath Yandra
Page 17
Shivrath Yandra
Page 18