Abstract
An algorithmic procedure has been developed for the realisation of any Boolean function F(n) of n variables with a single multiplexer of minimum size. This procedure gives the choice of control variables to be used for the realisation of the function. The algorithm is iterative in nature and very suitable for machine implementation.
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.
