Foundations for Applications of Gibbs Derivatives in Logic Design and VLSI

New technologies and increased requirements for performances of digital systems require new mathematical theories and tools as a basis for future VLSI CAD systems. New or alternative mathematical approaches and concepts must be suitable to solve some concrete problems in VLSI and efficient algorithms for their efficient application should be provided. This paper is an attempt in this direction and relates with the recently renewed interest in arithmetic expressions for switching functions, instead representations in Boolean structures, and spectral techniques and differential operators in switching theory and applications. Logic derivatives are efficiently used in solving different tasks in logic design, as for example, fault detection, functional decomposition, detection of symmetries and co-symmetries of logic functions, etc. Their application is based on the property that by differential operators, we can measure the rate of change of a logic function. However, by logic derivatives, we can hardly distinguish the direction of the change of the function, since they are defined in finite algebraic structures. Gibbs derivatives are a class of differential operators on groups, which applied to logic functions, permit to overcome this disadvantage of logic derivatives. Therefore, they may be useful in logic design in the same areas where the logic derivatives have been already using. For such applications, it is important to provide fast algorithms for calculation of Gibbs derivatives on finite groups efficiently in terms of space and time. In this paper, we discuss the methods for efficient calculation of Gibbs derivatives. These methods should represent a basis for further applications of these and related operators in VLSI CAD systems.