A comparative study of adders
MetadataShow full item record
This report compares the area, delay, and gate count complexity of 8, 16, 32, and 64 bit versions of several types of adders. For the purpose of the study, ripple carry adders, carry look-ahead adders, carry select adders, carry skip adders and Kogge Stone adders were used. To fulfill the study, the adders were implemented in structural Verilog using only 2-input NAND and NOR gates and inverters. The adders were synthesized using Design Vision (by Synopsys). Auto Place and Route was performed using Cadence Encounter to get the layout of the adders and then Parasitic Extraction was performed to get the actual routing delay. Primetime was used to calculate the post synthesis and post place and route delays. Post-PNR netlist was used to compare the area, and delay of the different adders.
Showing items related by title, author, creator and subject.
Choi, Youngmoon (2004)Adders are one of the critical elements in VLSI chips because of their variety of usages such as ALUs, floating point arithmetic units, memory addressing and program counting. For this reason, they have been studied for ...
Cho, Heumpil (2006)Quantum-dot cellular automata (QCA) is an emerging nanotechnology for electronic circuits. Its advantages such as faster speed, smaller size, and lower power consumption are very attractive. The fundamental device, ...
Chu, Wesley Donald (2013-12)In a previous paper it was shown that the use of carry lookahead adders can reduce the delay it takes to compute the product with Wallace and Dadda multipliers. In this report, a more detailed analysis is provided on the ...