Abstract

The article investigates a model of delays in a network of functional elements (a gate network) in an arbitrary finite complete basis B, where basis elements may have different input delays. Asymptotic bounds of the form τB n ± O(1), where τB is a constant that depends only on the basis B, are obtained for the delay of a multiplexer function of order n, i.e., a function with n address inputs and 2 n data inputs whose value equals the data input with index formed by the binary values of the address inputs. These bounds are used in the given model to obtain high-accuracy asymptotic bounds of the form τB(n - log log n) ± O(1) for the corresponding Shannon function, i.e., for the delay of the “worst” Boolean function of the given n variables.

Full Text
Paper version not known

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 call

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.