• DocumentCode
    1203728
  • Title

    Controllability in Linear Sequential Networks

  • Author

    Cohn, Martin

  • Volume
    9
  • Issue
    1
  • fYear
    1962
  • fDate
    3/1/1962 12:00:00 AM
  • Firstpage
    74
  • Lastpage
    78
  • Abstract
    A linear sequential network (LSN) with m inputs and n delay elements can be viewed both as a linear control system and as a sequential machine. A linear system is k controllable if and only if every state transition can be achieved in exactly k steps. It is shown that controllability is equivalent to n controllability, and that a LSN is n controllable if and only if it is a stronglyconnected sequential machine. Techniques are given for determining controllability in LSN\´s, for finding a sequence of n input vectors for an arbitrary state transition, and for finding a similar sequence of k input vectors, where k is the smallest integer such that the LSN is k controllable.
  • Keywords
    Added delay; Arithmetic; Circuit theory; Control systems; Controllability; Decoding; Digital control; Galois fields; Linear systems; Vectors;
  • fLanguage
    English
  • Journal_Title
    Circuit Theory, IRE Transactions on
  • Publisher
    ieee
  • ISSN
    0096-2007
  • Type

    jour

  • DOI
    10.1109/TCT.1962.1086863
  • Filename
    1086863