Show simple item record

Balance testing and balance-testable design of logic circuits

dc.contributor.authorChakrabarty, Krishnenduen_US
dc.contributor.authorHayes, John P. (John Patrick)en_US
dc.date.accessioned2006-09-08T20:58:33Z
dc.date.available2006-09-08T20:58:33Z
dc.date.issued1996-02en_US
dc.identifier.citationChakrabarty, Krishnendu; Hayes, John P.; (1996). "Balance testing and balance-testable design of logic circuits." Journal of Electronic Testing 8(1): 71-86. <http://hdl.handle.net/2027.42/43016>en_US
dc.identifier.issn0923-8174en_US
dc.identifier.issn1573-0727en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/43016
dc.description.abstractWe propose a low-cost method for testing logic circuits, termed balance testing, which is particularly suited to built-in self testing. Conceptually related to ones counting and syndrome testing, it detects faults by checking the difference between the number of ones and the number of zeros in the test response sequence. A key advantage of balance testing is that the testability of various fault types can be easily analyzed. We present a novel analysis technique which leads to necessary and sufficient conditions for the balance testability of the standard single stuck-line (SSL) faults. This analysis can be easily extended to multiple stuck-line and bridging faults. Balance testing also forms the basis for design for balance testability (DFBT), a systematic DFT technique that achieves full coverage of SSL faults. It places the unit under test in a low-cost framework circuit that guarantees complete balance testability. Unlike most existing DFT techniques, DFBT requires only one additional control input and no redesign of the underlying circuit is necessary. We present experimental results on applying balance testing to the ISCAS 85 benchmark circuits, which show that very high fault coverage is obtained for large circuits even with reduced deterministic test sets. This coverage can always be made 100% either by adding tests or applying DFBT.en_US
dc.format.extent1307971 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherEngineeringen_US
dc.subject.otherComputer-Aided Engineering (CAD, CAE) and Designen_US
dc.subject.otherElectronic and Computer Engineeringen_US
dc.subject.otherBuilt-in Self Testingen_US
dc.subject.otherDesign for Testabilityen_US
dc.subject.otherFault Coverageen_US
dc.subject.otherFault Detectionen_US
dc.subject.otherTesting Methodsen_US
dc.titleBalance testing and balance-testable design of logic circuitsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelElectrical Engineeringen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumAdvanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, 48109-2122, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherDepartment of Electrical, Computer and Systems Engineering, Boston University, 44 Cummington Street, 02215, Boston, MA, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/43016/1/10836_2004_Article_BF00136077.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF00136077en_US
dc.identifier.sourceJournal of Electronic Testingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.