Abstract
Butler [6] gave recurrence relations for computing the number N r (n) of r-valued (r ≥ 2) switching functions of n variables realizable by a cascaded network of n - 1 r-valued cells. The cascades are assumed to have a fixed-input variable assignment. In this correspondence similar recurrence relations are presented for the number M r (n) of such cascade realizable functions that depend on all n input variables. In particular, for the ternary valued case, explicit formulas for N 3 (n) and M 3 (n) are given. Some asymptotic properties of N r (n) and M r (n) are also derived, which show that their growth is asymptotically exponential as n increases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.