• DocumentCode
    887442
  • Title

    Boolean Memories

  • Author

    Danielsson, P.E.

  • Author_Institution
    Department of Electronics, Research Institute of National Defense, Stockholm, Sweden.
  • Issue
    1
  • fYear
    1966
  • Firstpage
    29
  • Lastpage
    35
  • Abstract
    Conditions for equilibrium states in Boolean nets by delay-free feedback are investigated. The result is a new class of circuits called memories, the simplest member of which is the ordinary set-reset flip-flop. A memory is defined as an asynchronous sequential machine with specific properties. The need for gain in feedback loops and the assumption that each amplifier is a NOT operator make it possible to state two theorems on the equilibrium codes. In algebraic treatment it is shown how to design a memory from a given state assignment. Symmetric Boolean memories include multistable flip-flops but also, for instance, a decadic memory utilizing only five inverters.
  • Keywords
    Algebra; Automata; Books; Circuit theory; Counting circuits; Delay; Error correction codes; Flip-flops; Linearity; Testing;
  • fLanguage
    English
  • Journal_Title
    Electronic Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0367-7508
  • Type

    jour

  • DOI
    10.1109/PGEC.1966.264373
  • Filename
    4038664