By Topic

Efficient addressing scheme for sequentially accessed serial highways

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 $31
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)
Fenna, D.S. ; Teesside Polytechnic, Department of Electrical Instrumentation & Control Engineering, Middlesbrough, UK

It is now common practice in industrial applications of digital electronics for plant interface units to be geographically distributed and connected to a central point by a time-division multiplexed serial link. As in all such links, some means must be provided for each interface unit to send or accept data only in its allotted time, and the paper describes an arrangement which minimises the time consumed by this addressing function without sacrificing reliability in noisy environments. It entails the central station sending one bit of address information in each unit's time slot, in such a way that the current n-bit address is formed by the n most recently received address bits. Each unit can verify this process. The method is suitable for applications, in which many remote units are scanned sequentially to exchange data with a central station; for example, in datalogging.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:129 ,  Issue: 6 )