Referenced Items are not available for this document.
A shortcut hand-reduction method known as the Karnaugh map (K map) is an efficient way of reducing Boolean functions to a minimum form for the purpose of minimizing hardware requirements. In this paper, by applying the prime group and the essential prime group concepts of the K maps to pattern classification problems, the K1-map reduction method is proposed. The K1-map reduction method can be used to design restricted Coulomb energy networks and to determine the number of hidden units problems in a systematic manner
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:19
,
Issue:
6
)
Date of Publication: Jun 1997
- Page(s):
- 616 - 622
- ISSN :
- 0162-8828
- INSPEC Accession Number:
- 5633190
- Digital Object Identifier :
- 10.1109/34.601249
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jun 1997
- Sponsored by :
- IEEE Computer Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
