Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/72792
DC Field | Value | |
---|---|---|
dc.title | New multiple-function logic family | |
dc.contributor.author | Tan, Y.K. | |
dc.contributor.author | Lim, Y.C. | |
dc.contributor.author | Kwok, C.Y. | |
dc.contributor.author | Ling, C.H. | |
dc.date.accessioned | 2014-06-19T05:12:02Z | |
dc.date.available | 2014-06-19T05:12:02Z | |
dc.date.issued | 1989 | |
dc.identifier.citation | Tan, Y.K.,Lim, Y.C.,Kwok, C.Y.,Ling, C.H. (1989). New multiple-function logic family. Proceedings - IEEE International Symposium on Circuits and Systems 2 : 965-968. ScholarBank@NUS Repository. | |
dc.identifier.issn | 02714310 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/72792 | |
dc.description.abstract | A novel technique is presented for the design of a multiple-function logic (MFL) circuit which generates several Boolean functions simultaneously and shares the transistors implementing the common subexpression of these Boolean functions. For certain circuits, this approach requires fewer transistors and reduces the gate delays compared with the conventional approach where the common subexpression is implemented as a new intermediate function, shared by other gates to generate the required outputs. The application of the technique to a CMOS domino logic 4-b carry-lookahead generator and an nMOS 1-of-8 decoder results in savings of 45.0% and 42.5%, respectively, in the number of transistors needed. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.sourcetitle | Proceedings - IEEE International Symposium on Circuits and Systems | |
dc.description.volume | 2 | |
dc.description.page | 965-968 | |
dc.description.coden | PICSD | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.