• DocumentCode
    3106679
  • Title

    Decomposing data machines

  • Author

    Wolf, Wayne

  • Author_Institution
    Dept. of Electr. Eng., Princeton Univ., NJ, USA
  • fYear
    1991
  • fDate
    25-28 Feb 1991
  • Firstpage
    378
  • Lastpage
    382
  • Abstract
    Describes a new FSM decomposition algorithm which extracts a data register from a given FSM. The algorithm is a generalization of the standard minimization algorithm-it selects output values which, when stored in a separate data register, will make additional states in the control machine equivalent. Experimental results show that the algorithm is both effective and fast
  • Keywords
    finite automata; minimisation of switching nets; FSM decomposition algorithm; control machine; data register; finite state machines; standard minimization algorithm; Algebra; Ash; Cost function; Data mining; High level synthesis; Lattices; Minimization methods; Partitioning algorithms; Pipeline processing; Prototypes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation. EDAC., Proceedings of the European Conference on
  • Conference_Location
    Amsterdam
  • Type

    conf

  • DOI
    10.1109/EDAC.1991.206429
  • Filename
    206429
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3106679