Please use this identifier to cite or link to this item: http://dspace.unimap.edu.my:80/xmlui/handle/123456789/40277
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSiti Nurhanani, Che Yahaya-
dc.date.accessioned2015-07-14T03:27:06Z-
dc.date.available2015-07-14T03:27:06Z-
dc.date.issued2011-06-
dc.identifier.urihttp://dspace.unimap.edu.my:80/xmlui/handle/123456789/40277-
dc.descriptionAccess is limited to UniMAP community.en_US
dc.description.abstractIn this project, two types of circuit topologies has been designed which are the 4-B its Ripple-Carry Adder Circuit (RCA) and the 4-Bits Carry Look-Ahead Adder Circuit (CLA). Delays in RCA circuit will be compared between before and after applying the Logical Effort method to determine which circuit is good in terms of having a faster response between input and output. Besides, RCA circuit also will be compared with CLA circuit to show that different circuit topologies with the same circuit function would have different circuit delays. The Logical Effort method, includessome steps such as path effort computation, best number of stages computation, minimum delay estimation, best stage effort determination and sizing the gates in the RCA circuit. In this project, after applying the Logical Effort method, the circuit will have less delays compared to the same circuit that does not apply Logical Effort, with an improvement is about 44.15%. Meanwhile, the average improvement of CLA over RCA is about 64.85% , which means different circuit topologies would have different delays. The more complex a circuit is (high fan-in) it produces more delays. Gates number did not affected the delays in a circuit which sometimes, by having addition stages with same circuit function would improved the delays and produced fast response circuit.en_US
dc.language.isoenen_US
dc.publisherUniversiti Malaysia Perlis (UniMAP)en_US
dc.subjectRipple-Carry Adder Circuit (RCA)en_US
dc.subjectCircuit topologiesen_US
dc.subjectCarry look-ahead adder (CLA)en_US
dc.titleComparison of delays between 4-bits ripple-carry adder and 4-bits carry look-ahead adder using logical effort methoden_US
dc.typeLearning Objecten_US
dc.contributor.advisorNorina Idrisen_US
dc.publisher.departmentSchool of Microelectronic Engineeringen_US
Appears in Collections:School of Microelectronic Engineering (FYP)

Files in This Item:
File Description SizeFormat 
Abstract, Acknowledgement.pdf127.88 kBAdobe PDFView/Open
Introduction.pdf88.59 kBAdobe PDFView/Open
Literature review.pdf391.71 kBAdobe PDFView/Open
Methodology.pdf704.05 kBAdobe PDFView/Open
Results and discussion.pdf434.73 kBAdobe PDFView/Open
Conclusion.pdf88.32 kBAdobe PDFView/Open
Reference and appendix.pdf127.39 kBAdobe PDFView/Open


Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.