(Self-)reconfigurable Finite State Machines: Theory and Implementation

  • Authors:
  • J. Teich;M. Köster

  • Affiliations:
  • University of Paderborn, Computer Engineering Laboratory, Paderborn, Germany;University of Paderborn, Computer Engineering Laboratory, Paderborn, Germany

  • Venue:
  • Proceedings of the conference on Design, automation and test in Europe
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce the concept of (self-)reconfigurablefinite state machines as a formal model to describestate-machines implemented in hardware that maybe reconfigured during operation. By the advent of reconfigurablelogic devices such as FPGAs, this model may becomeimportant to characterize and implement (self-)reconfigurablehardware. An FSM is called (self-)reconfigurableif reconfiguration of either output function or transitionfunction is initiated by the FSM itself and not based on externalreconfiguration events. We propose an efficient hard-warerealisation and give algorithmic solutions and boundsfor the reconfiguration overhead of migrating a given FSMspecification into a new target FSM.