Irredundant binate realizations of unate functions

Combinational circuits realizing unate Functions are usually simple in structure and their behaviour under the stuck-at fault model is seemingly well understood. This paper exemplifies the fact that a circuit designer may construct many peculiar irredundant circuits realizing unate functions. First, a counter-example is presented contradicting the existing notion of non-realizability of a unate function by a single-output, irredundant, binate combinational circuit. On the contrary, almost all unate functions are shown to be realizable with single-output networks that are binate as well as irredundant. A very rare example of a unate function is then cited; it has an irredundant circuit realization, none of whose primary input lines is unate.

[1]  John P. Hayes On the Properties of Irredundant Logic Networks , 1976, IEEE Transactions on Computers.

[2]  Susanta Chakraborty,et al.  Logical redundancies in irredundant combinational circuits , 1993, J. Electron. Test..

[3]  Victor P. Nelson Fault-tolerant computing: fundamental concepts , 1990, Computer.

[4]  Vijay Pitchumani,et al.  Functional Test Generation Based on Unate Function Theory , 1988, IEEE Trans. Computers.

[5]  Niraj K. Jha,et al.  A universal test set for CMOS circuits , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Sheldon B. Akers,et al.  Universal Test Sets for Logic Networks , 1972, IEEE Transactions on Computers.

[7]  Stanley L. Hurst,et al.  Spectral techniques in digital logic , 1985 .

[8]  Rodolfo Betancourt Derivation of Minimum Test Sets for Unate Logical Circuits , 1971, IEEE Transactions on Computers.

[9]  Sudhakar M. Reddy,et al.  Complete Test Sets for Logic Functions , 1973, IEEE Transactions on Computers.

[10]  Sudhakar M. Reddy,et al.  Fault Detecting Test Sets for Reed-Muller Canonic Networks , 1975, IEEE Transactions on Computers.