Issue No. 12 - December (1974 vol. 23)
K. Chakrabarti , Gesellschaft f?r Mathematik und Datenverarbeitung mbH
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.
Admissible partition, best tree, disjunctive decomposition of a function, flexible cells, irredundant tree, unique form, unique partition.
O. Kolp and K. Chakrabarti, "Fan-In Constrained Tree Networks of Flexibe Cells," in IEEE Transactions on Computers, vol. 23, no. , pp. 1238-1249, 1974.