By Topic

The Tree Set of a Linear Machine

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)
Iwao Toda ; Electrical Communication Lab., Musashino-shi, Tokyo, Japan.

Linear sequential machines are finding an increasing number of uses in error correction, random number generation, and other digital applications. Autonomous behaviors of such machines with nonsingular characteristic matrix have been widely studied. Their state graphs consist of a set of cycles, which is most conveniently described by a cycle set. Analysis and synthesis of such machines have been completely established in terms of cycle sets. The purpose of this paper is to extend the result to the linear machines with singular matrices. The stage graphs of such machines consist of a set of cycles and a tree. The latter part can analogously be described by a tree set. The product and quotient of two tree sets are defined, and it is shown that a tree is realizable by a linear machine if and only if its tree set is a product of canonical tree sets.

Published in:

IEEE Transactions on Electronic Computers  (Volume:EC-14 ,  Issue: 6 )