JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Jurcă, Lucian Aurel | |
| dc.contributor.author | Maranescu, Valentin-Ioan | |
| dc.date.accessioned | 2021-12-09T13:55:52Z | |
| dc.date.available | 2021-12-09T13:55:52Z | |
| dc.date.issued | 2004 | |
| dc.identifier.citation | Jurcă, Lucian Aurel. A new way to build a very fast binary adder. Timişoara: Editura Politehnica, 2004 | en_US |
| dc.identifier.uri | http://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.abstract | This 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.iso | en | en_US |
| dc.publisher | Timişoara : Editura Politehnica | en_US |
| dc.relation.ispartofseries | Buletinul ş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.subject | Carry look-ahead adder | en_US |
| dc.subject | Carry select adder | en_US |
| dc.subject | Arithmetic processor | en_US |
| dc.title | A new way to build a very fast binary adder [articol] | en_US |
| dc.type | Article | en_US |
