International Research Journal of Engineering and Technology (IRJET)
e-ISSN: 2395-0056
Volume: 06 Issue: 12 | Dec 2019
p-ISSN: 2395-0072
www.irjet.net
Comparative Study of Implementation of 8-bit Carry Select Adder using different Technologies Uttara Bhatt1, Ameya Tudavekar2, Nishant Sharma3, Swapnil Gite4 1Assistant
Professor, Electronics and Telecommunication, Thadomal Shahani Engineering College, Maharashtra, India 2,3,4Undergraduate Student, Electronics and Telecommunication, Thadomal Shahani Engineering College, Maharashtra, India ---------------------------------------------------------------------***---------------------------------------------------------------------Abstract - The addition of two numbers represents the most fundamental arithmetic operation that can be done on two numbers. The addition of two multi-bit numbers involves the propagation of a carry component from one stage to the next. When computations involve large numbers the propagation of this carry component presents a bottleneck to overall system speed as the overall circuit delay is represented by the time taken to produce the sum of the final input bits. This paper analyses an eight-bit carry select adder utilizing four bit carry look ahead adders as the individual stages. Further, the carry look ahead adders have been implemented using three MOS circuit design styles, Static, Dynamic (MODL) and Pass Transistor logic. Key Words: full adder, carry propagation, propagation delay, carry look ahead adder, carry select adder, static, dynamic, pass transistor. 1. INTRODUCTION The mathematical operation of addition is the most fundamental calculation that can be done with two numbers. Addition allows us to combine two numbers and see the value of the overall result. The addition of two numbers can produce a carry from the lower digits to the higher digits depending on the inputs applied. Since a digital adder works on binary bits, the additions of two one’s produces a carry with the sum being zero. 1.1 Full Adder
stage. RCA has the easiest architecture and has the least area required, the complexity and delay increase of a Ripple Carry Adder is linear to the increase in the number of bits.
Fig -1: Ripple Carry Adder[3] 1.3 Carry Look Ahead The Carry Look Ahead adder is a fast adder in which the generation of successive carry bits is not dependent on generation of carry from previous bit additions. The extra segments of this adder are the carry propagate and carry generate, where the carry propagate will be propagated to the next stages and the carry generate is responsible for the advanced generation of carry irrespective of input carry given to the first stage.[2] Carry bits are generated simultaneously significantly mitigating the problem of propagation delay faced in RCA but at the cost of increased circuitry. A major drawback of CLA adders is that the increase in circuit complexity is exponential compared to the increase in input bits hence is usually limited to 4 bit adders.
Adders form an essential part of any arithmetic circuit. In digital VLSI, the process of addition can be realized using the following Boolean equation insert Boolean equation that can be implemented using the following three basic logic gates, the XOR gate to generate the sum part of addition, AND gates and OR gates to produce the carry from a lower stage to the next higher stage. The circuit shown in figure-1 represents a one bit adder full adder which takes three inputs namely A, B and Cin where A is the first bit, B is the second bit and Cin represents the carry input from the previous stage.
Pi=Ai⊕Bi
1.2 Ripple Carry Adder
Gi=Ai.Bi
N-bit adder can be created by cascading N full adders, such an adder is called a Ripple Carry Adder. The carry of previous stage is needed to calculate the sum of the next
Si=Ci⊕Ai⊕Bi
© 2019, IRJET
|
Impact Factor value: 7.34
|
Fig -2: Carry Look Ahead[3]
ISO 9001:2008 Certified Journal
|
Page 242