Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization

Auto symmetric functions are a class of Boolean functions whose regular structure can be exploited by synthesis algorithms in order to reduce the minimization time and to derive more compact algebraic forms. In this paper we propose a generalization of this class of functions to the multiple-valued logic framework. We also study the spectral properties of auto symmetric functions and provide a complete spectral characterization for both the Boolean and the multiple-valued setting.