Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/4080
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJurcă, Lucian Aurel-
dc.contributor.authorMaranescu, Valentin-Ioan-
dc.date.accessioned2021-12-09T13:55:52Z-
dc.date.available2021-12-09T13:55:52Z-
dc.date.issued2004-
dc.identifier.citationJurcă, Lucian Aurel. A new way to build a very fast binary adder. Timişoara: Editura Politehnica, 2004en_US
dc.identifier.urihttp://primo.upt.ro:1701/primo-explore/search?query=any,contains,A%20new%20way%20to%20build%20a%20very%20fast%20binary%20adder&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo-
dc.description.abstractThis article presents a new way to build a very fast binary adder and the simulation results for a 32-b adder which confirmed that the operation speed is superior to other types of adders found in field literature. The adder is organised in two hierarchical levels. The superior level presents a carry select adder structure whose component blocks are 8-b carry look-ahead adders, which form the inferior level. Adopting the carry select mechanism and the new manner in which that was implemented allowed the maximum exploitance of the specific features of a carry look-ahead adder.en_US
dc.language.isoenen_US
dc.publisherTimişoara : Editura Politehnicaen_US
dc.relation.ispartofseriesBuletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 1 (2004), p. 193-198-
dc.subjectCarry look-ahead adderen_US
dc.subjectCarry select adderen_US
dc.subjectArithmetic processoren_US
dc.titleA new way to build a very fast binary adder [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Jurca_f.pdf721.59 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.