By Topic

Capacity of multilevel threshold devices

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
$33 $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

1 Author(s)
T. A. Diep ; Dept. of Risk Anal. & Decision Syst., Visa Internat., San Francisco, CA, USA

The principal purpose of this research is to discover the underlying properties of linear multilevel threshold devices and networks of linear multilevel threshold devices. The main theoretical developments of this investigation entail generalizing the function-counting theorem associated with linear bi-level threshold devices to that of linear multilevel threshold devices. The investigation reveals surprising connections that underlie linear inequalities, linear separability, linear ordering, and region counting. The results have implications in the field of geometric probability. Computations based on theoretical analysis support Brown's (1964) conjecture and suggest that k/(k-1) is a natural definition for the information-storage capacity of a k-level threshold device. A lower bound on the number of weights required to implement a universal network of k-level threshold devices is derived. Finally, it is shown that the Vapnik-Chervonenki (1971)s dimension (VC-dimension) for the class of multilevel threshold function is d+1 for pattern vectors in ℛd . This VC-dimension is also linked to an error-rate bound for multilevel threshold functions within the framework of uniform learnability

Published in:

IEEE Transactions on Information Theory  (Volume:44 ,  Issue: 1 )