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

Strongly fault secure PLAs and totally self-checking checkers

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

2 Author(s)
Min, Y. ; Inst. of Comput. Technol., Acad. Sinica, Beijing, China ; Li, J.

A general approach is presented to the design of totally self-checking (TSC) programmable logic arrays (PLAs). A strongly fault secure (SFS) implementation is suggested for the functional PLA, which is shown to be SFS whenever the output is encoded by two-rail code. K-unit TSC checker (TSCC) element are defined to construct TSC checkers. The TSCC is very appropriate for the companion of the SLF PLA since a given input codeword set is sufficient for testing the TSCC. The minimum number of tests needed for a type-m two-rail code K -unit TSCC is 12m. This is a generalization of the fact that four test patterns are sufficient for testing an XOB parity checker tree. As an application, a novel design of a TSC comparator with an arbitrary number of inputs is presented

Published in:

Computers, IEEE Transactions on  (Volume:37 ,  Issue: 7 )

Date of Publication:

Jul 1988

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.