Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/54882
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Shaochen | |
dc.date.accessioned | 2013-10-22T07:24:12Z | |
dc.date.available | 2013-10-22T07:24:12Z | |
dc.date.copyright | 2013 | en_US |
dc.date.issued | 2013 | |
dc.identifier.uri | http://hdl.handle.net/10356/54882 | |
dc.description.abstract | Addition is the basic operation in many modern electronic applications. As the fastest adder, parallel prefix adder is of most interest for many circuit designers. For the past few decades, supply voltage and the size of transistors have been reduced tremendously. With more and more transistors being integrated on one single chip, the power issue must be taken care of. Low power adder has been studied for years and many solutions are proposed. In this paper, a new circuit is designed at transistor level. The proposed circuit cells adopt transmission gate logic and develop a MUXbased structure. Simulations are conducted using Cadence. The result shows that the new adder demonstrates a better performance in terms of power dissipation. It saves more than 30% energy in all the adders with different word length. | en_US |
dc.format.extent | 72 p. | en_US |
dc.language.iso | en | en_US |
dc.subject | DRNTU::Engineering | en_US |
dc.title | Low power CMOS parallel prefix adders | en_US |
dc.type | Thesis | |
dc.contributor.supervisor | Lau Kim Teen | en_US |
dc.contributor.school | School of Electrical and Electronic Engineering | en_US |
dc.description.degree | Master of Science (Electronics) | en_US |
item.grantfulltext | restricted | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | EEE Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yang Shaochen13.pdf Restricted Access | 10.35 MB | Adobe PDF | View/Open |
Page view(s) 50
516
Updated on Apr 26, 2025
Download(s) 50
21
Updated on Apr 26, 2025
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.