A New Synthesis of Symmetric Functions

Authors:
Hafizur Rahaman;Debesh K. Das;Bhargab B. Bhattacharya
Affiliations:
Computer Sc. & Tech., A. P. C. Roy Polytechnic College, Kolkata-700 032, India;Computer Sc. & Engg., Jadavpur University, Kolkata-700 032, India;Computer Sc. & Engg., University of Nebraska-Lincoln, Lincoln, NE
Venue:
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Year:
2002

Citing 3
Cited 2

Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Synthesis of symmetric functions for path-delay fault testability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Delay-testable implementations of symmetric functions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Implementing Symmetric Functions with Hierarchical Modules for Stuck-At and Path-Delay Fault Testability

Journal of Electronic Testing: Theory and Applications
Testable design of digital summation threshold logic array for synthesis of symmetric functions

International Journal of Computers and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach to synthesizing totally symmetric Boolean functions is resented. 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 2-input, 2-output AND-OR cells, and admits a recursive construction. The design provides a significant reduction in hardware cost compared to other existing techniques.