Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Fast and optimal synthesis of binary threshold neural networks
- Authors
- Rhee, Frank
- Issue Date
- Aug-2002
- Publisher
- Oxford University Press
- Keywords
- perceptrons; binary threshold neural networks; MSP term grouping
- Citation
- IEICE Transactions on Communications, v.E85B, no.8, pp 1608 - 1613
- Pages
- 6
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE Transactions on Communications
- Volume
- E85B
- Number
- 8
- Start Page
- 1608
- End Page
- 1613
- ISSN
- 0916-8516
1745-1345
- Abstract
- A new algorithm for synthesizing binary threshold neural networks (BTNNs) is proposed. A binary (Boolean) input-output mapping that can be represented by minimal sum-of-product (MSP) terms is initially obtained from training data. The BTNN is then synthesized based on an MSP term grouping method. As a result, a fast and optimal realization of a BTNN can be obtained. Examples of both feedforward and recurrent BTNN synthesis used in a parallel processing architecture are given and compared with other existing methods.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Rhee, Chung Hoon Frank
- ERICA 공학대학 (SCHOOL OF ELECTRICAL ENGINEERING)