A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this module, a general symmetric function is then realized following a unate decomposition method. The cellular structure is simple and universal – it uses only 2input, 2-output AND-OR cells, and admits a recursive construction. The design provides a significant reduction in hardware cost compared to other existing techniques.
Hafizur Rahaman, Debesh K. Das, Bhargab B. Bhattac