This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Properties of Irredundant Logic Networks
September 1976 (vol. 25 no. 9)
pp. 884-892
J.P. Hayes, Department of Electrical Engineering and the Computer Science Program, University of Southern California
The constraints imposed by various types of irredundancy on the structure of combinational logic networks are investigated. It is shown that the usual notion of irredundancy, here called a-irredundancy, places bounds on the maximum number of inputs to certain types of network structures. A network is called b-redundant if it contains a cascade of single-input gates that can be reduced to either an
Index Terms:
Combinational networks, irredundant networks, logic circuits, logic design optimization, redundancy, redundancy testing, redundancy types.
Citation:
J.P. Hayes, "On the Properties of Irredundant Logic Networks," IEEE Transactions on Computers, vol. 25, no. 9, pp. 884-892, Sept. 1976, doi:10.1109/TC.1976.1674713
Usage of this product signifies your acceptance of the Terms of Use.