Cart (Loading....) | Create Account
Close category search window
 

The Theory of Autonomous Linear Sequential Networks

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

Analysis and synthesis techniques for a class of sequential discrete-state networks are discussed. These networks, made up of arbitrary interconnections of unit-delay elements (or of trigger flip-flops), modulo-p adders, and scalar multipliers (moduloalpha, primep), are of importance in unconventional radar and communication systems, in automatic error-correction circuits, and in the control circuits of digital computers. In addition, these networks are of theoretical significance to the study of more general sequential networks. The basic problem with which this paper is concerned is that of finding economical realizations of such networks for prescribed autonomous (excitation-free) behavior. To this end, an analytical-algebraic model is described which permits the investigation of the relation between network logical structure and state-sequential behavior. This relation is studied in detail for nonsingular networks (those with purely cyclic behavior). Among the results of this investigation is the establishment of relations between the state diagram of the network and a characteristic polynomial derived from its logical structure, An operation of multiplication of state diagrams is shown to correspond to multiplication of the corresponding polynomials. A criterion is established for the realizability of prescribed cyclic behavior by means of linear autonomous sequential networks. An effective procedure for the economical realization of such networks is described, and it is shown that linear feedback shift registers constitute a canonical class of realizations. Examples are given of the realization procedure. The problem of synthesis with only one-cycle length specified is also discussed. A partial solution is obtained to this "don't care" problem. Some special families of feedback shift registers are investigated in detail, and the state-diagram structures are obtained for an arbitrary number of stages and an arbitrary (prime) modulus. Mathematical appendixes are included which summarize the pertinent results in Galois field theory and in the factorization of cyclotomic polynomials into irreducible factors over a modular field. The relation of the theory developed in this paper to Huffman's description of linear sequence tr- ansducers in terms of the D operator is discussed, as well as unsolved problems and directions for further generalization.

Published in:

Circuit Theory, IRE Transactions on  (Volume:6 ,  Issue: 1 )

Date of Publication:

Mar 1959

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.