(Self-)reconfigurable finite state machines: Theory and implementation

Teich J (2002)


Publication Status: Published

Publication Type: Conference contribution, Conference Contribution

Publication year: 2002

Pages Range: 559-566

Article Number: 998356

Conference Proceedings Title: Proc. DATE 2002, Design, Automation and Test in Europe

Event location: Paris FR

DOI: 10.1109/DATE.2002.998356

Abstract

In this paper, we introduce the concept of (self-)reconfigurable finite state machines as a formal model to describe state-machines implemented in hardware that may be reconfigured during operation. By the advent of reconfigurable logic devices such as FPGAs, this model may become important to characterize and implement (self-)reconfigurable hardware. An FSM is called (self-)reconfigurable if reconfiguration of either output function or transition function is initiated by the FSM itself and not based on external reconfiguration events. We propose an efficient hardware realisation and give algorithmic solutions and bounds for the reconfiguration overhead of migrating a given FSM specification into a new target FSM. © 2002 IEEE.

Authors with CRIS profile

How to cite

APA:

Teich, J. (2002). (Self-)reconfigurable finite state machines: Theory and implementation. In Proc. DATE 2002, Design, Automation and Test in Europe (pp. 559-566). Paris, FR.

MLA:

Teich, Jürgen. "(Self-)reconfigurable finite state machines: Theory and implementation." Proceedings of the 2002 Design, Automation and Test in Europe Conference and Exhibition, DATE 2002, Paris 2002. 559-566.

BibTeX: Download