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

PLA Implementation of k-out-of-n Code TSC Checker

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)
Bose, B. ; Department of Computer Science, Oregon State University ; Lin, D.J.

PLA implementations of totally self-checking (TSC) checkers for k-out-of-n codes, where 2 ≤k ≤ n -2, are presented. For k-out-of-2k, k-out-of-2k + 1, k + 1-out-of-2k + 1, and k ± 1-out-of-2k codes, TSC checkers are designed using only one PLA. TSC checkers for all other codes are designed using 2 PLA's, and in fact the second PLA is very small for most of the codes.

Published in:

Computers, IEEE Transactions on  (Volume:C-33 ,  Issue: 6 )

Date of Publication:

June 1984

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.