Complexity of cellural decoders with repeating inputs

Abstract

The cellular schema model (CS) was first proposed in 1967 by S.S. Kravtsov, who also obtained the order of the Shannon function for it. Model CS is a mathematical model of integrated circuits (IC), taking into account features of physical synthesis. Presence of requirements for geometry schemes that ensure that the necessary routing resources are taken into account when creation of IP, represents a fundamental difference from good studied classes of circuits from functional elements (SFE). Similar mathematical model in foreign sources was described in 1980 K.D. Thompson. For IP-related studies, the model is fundamental, and is considered a satisfactory approximation for IS, at least for single crystal systems. Moreover, she remains an accurate approximation for small areas (individual components) IP in cases where the model cannot correctly reflect all features of the designed systems. In this work asymptotic estimates for the area of cellular schemes are established, implementing a decoder of order n with repeated inputs.