• DocumentCode
    2732375
  • Title

    A Graph-Based Approach to Symbolic Functional Decomposition of Finite State Machines

  • Author

    Szotkowski, Piotr ; Rawski, Mariusz ; Selvaraj, Henry

  • Author_Institution
    Inst. of Telecommun., Warsaw Univ. of Technol., Warsaw
  • fYear
    2008
  • fDate
    19-21 Aug. 2008
  • Firstpage
    356
  • Lastpage
    361
  • Abstract
    This paper discusses the symbolic functional decomposition method for implementing finite state machines in field-programmable gate array devices as a viable alternative to the presently widespread two-step approach to the problem, which consist of separate encoding and mapping stages. Also, a new algorithm for obtaining the betaG and betaQv blankets is introduced, along with results showing the advantages of this method in comparison to the current state-of-the-art solutions.
  • Keywords
    encoding; field programmable gate arrays; finite state machines; graph theory; encoding; field-programmable gate array devices; finite state machines; graph theory; symbolic functional decomposition; Automata; Boolean functions; Encoding; Field programmable gate arrays; Logic arrays; Logic devices; Optimization methods; Resource management; Systems engineering and theory; FPGA; FSM; decomposition; encoding; finite state machine; symbolic functional decomposition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems Engineering, 2008. ICSENG '08. 19th International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    978-0-7695-3331-5
  • Type

    conf

  • DOI
    10.1109/ICSEng.2008.66
  • Filename
    4616663
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2732375