By Topic

Minimizing and Equally Loading Switches or Spatially Shared Drivers in a Multidevice Sequential Time System

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)

An algorithm is presented to determine spatially shared driver (switch) sequences in a system which requires several drivers (switches) to activate a given device. The algorithm results in minimizing the number of drivers (switches) and in uniformly loading them if the probability density function for device selection is uniform. Plasma display and magnetic bubble memory applications illustrate the method.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:11 ,  Issue: 5 )