A Simple Delay Testable Synthesis of Symmetric Functions

Abstract

This paper presents a new technique for implementing totally symmetric Boolean functions. First, a simple universal cellular module that admits a recursive structure is designed for synthesizing unate symmetric functions. General symmetric functions are then realized following a unate decomposition method. This design guarantees complete and robust path delay testability. Experimental results on several symmetric functions reveal that the hardware cost of the proposed design is low, and the number of paths in the circuit is reduced significantly compared to those in earlier designs. Results on circuit area and delay for a few benchmark circuits are also reported.