DocumentCode
1114084
Title
Fan-In Constrained Tree Networks of Flexibe Cells
Author
Chakrabarti, K. ; Kolp, Otto
Author_Institution
Gesellschaft für Mathematik und Datenverarbeitung mbH
Issue
12
fYear
1974
Firstpage
1238
Lastpage
1249
Abstract
This paper is concerned with the synthesis of irredundant tree networks with two-input single-output flexible cells. An algorithm is developed which tests whether a given Boolean function is tree realizable; if it is tree realizable, a best tree is generated which realizes the function. It is shown that for each realizable function there exists a nontrivial unique partition from which a best tree can be constructed. Finally, the number of functions realizable by irredundant trees is determined.
Keywords
Admissible partition, best tree, disjunctive decomposition of a function, flexible cells, irredundant tree, unique form, unique partition.; Bismuth; Boolean functions; Fabrication; Integrated circuit interconnections; Logic devices; Network synthesis; Partitioning algorithms; Switching circuits; System performance; Testing; Admissible partition, best tree, disjunctive decomposition of a function, flexible cells, irredundant tree, unique form, unique partition.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223842
Filename
1672435
Link To Document