This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fan-In Constrained Tree Networks of Flexibe Cells
December 1974 (vol. 23 no. 12)
pp. 1238-1249
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.
Index Terms:
Admissible partition, best tree, disjunctive decomposition of a function, flexible cells, irredundant tree, unique form, unique partition.
Citation:
K. Chakrabarti, O. Kolp, "Fan-In Constrained Tree Networks of Flexibe Cells," IEEE Transactions on Computers, vol. 23, no. 12, pp. 1238-1249, Dec. 1974, doi:10.1109/T-C.1974.223842
Usage of this product signifies your acceptance of the Terms of Use.