HEAL DSpace
A Method to Generate the Prime Cascades of an Arbitrary Switching Function
DSpace/Manakin Repository
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Papakonstantinou, G | en |
| dc.date.accessioned | 2014-03-01T01:37:50Z | |
| dc.date.available | 2014-03-01T01:37:50Z | |
| dc.date.issued | 1977 | en |
| dc.identifier.uri | https://dspace.lib.ntua.gr/xmlui/handle/123456789/21775 | |
| dc.subject | Logic Design | en |
| dc.title | A Method to Generate the Prime Cascades of an Arbitrary Switching Function | en |
| heal.type | journalArticle | en |
| heal.identifier.primary | 10.1109/TC.1977.1674867 | en |
| heal.identifier.secondary | http://dx.doi.org/10.1109/TC.1977.1674867 | en |
| heal.publicationDate | 1977 | en |
| heal.abstract | A method is described to generate all prime cascades of the restricted Maitra type with fixed input order, of an arbitrary switching function. The method allows the optimal synthesis of cutpoint cellular arrays. | en |
| heal.journalName | IEEE Transactions on Computers | en |
| dc.identifier.doi | 10.1109/TC.1977.1674867 | en |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
