Cart (Loading....) | Create Account
Close category search window

On the Existence of Combinational Logic Circuits Exhibiting Multiple Redundancy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Smith, J.E. ; Department of Electrical and Computer Engineering, University of Wisconsin

Multiple redundancy is a very complex form of redundancy about which little is known. This correspondence shows by construction that redundancy of any multiplicity can exist in an arbitrary combinational circuit, and that redundancy of any multiplicity ≥ 4 can exist in a tree circuit. Many examples are given. The correspondence concludes with a discussion of the effect multiple redundancy can have on multiple fault testing. It is shown that with a proper algorithm multiple redundancy can actually cause fewer problems than single redundancy does when single fault testing is being considered.

Published in:

Computers, IEEE Transactions on  (Volume:C-27 ,  Issue: 12 )

Date of Publication:

Dec. 1978

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.