A comparative study of adders

Simple item page
dc.contributor.advisorSwartzlander, Earl E., Jr., 1945-
dc.contributor.committeeMemberJohn, Lizy K
dc.creatorDas, Poulami
dc.creator.orcid0000-0003-4292-4503
dc.date.accessioned2016-10-18T16:39:06Z
dc.date.accessioned2018-01-22T22:30:48Z
dc.date.available2016-10-18T16:39:06Z
dc.date.available2018-01-22T22:30:48Z
dc.date.issued2016-05
dc.date.submittedMay 2016
dc.date.updated2016-10-18T16:39:06Z
dc.description.abstractThis 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.
dc.description.departmentElectrical and Computer Engineering
dc.format.mimetypeapplication/pdf
dc.identifierdoi:10.15781/T2FX74054
dc.identifier.urihttp://hdl.handle.net/2152/41700
dc.language.isoen
dc.subjectAdders
dc.subjectRipple carry adder
dc.subjectCarry select adder
dc.subjectCarry skip adder
dc.subjectCarry lookahead adder
dc.subjectKogge stone adder
dc.titleA comparative study of adders
dc.typeThesis
dc.type.materialtext

Files

Collections

University of Texas at Austin