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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
