Synthesis of Multithreshold Threshold Gates

This paper presents novel synthesis algorithm capable of generating Multithreshold Threshold Gate (MTTG) structure for arbitrary Boolean function. Algorithm draws from dedicated efficient threshold decomposition procedure that represents Boolean function as a $\min/\max$ composition of threshold functions. Since the proposed threshold decomposition procedure outputs minimal number of thresholds therefore the resulting gate is compact -- for $k$-threshold $n$-input Boolean function at most $(k+1)(n+1)$ NDR elements in a $(k+1)$-level gate structure, and $(k+1)n$ transistors are required.