Look-Back Technique to Generate Multistep Finite State Machines

Nowadays, technologies are attempting to increase systems speed beyond the limits imposed by the capacity of the systems themselves. That is the case of finite state machines where improving the iteration bound is critical for reaching the desired performance. A good solution to improve them is to p...

Full description

Saved in:
Bibliographic Details
Published inElectronics, Robotics and Automotive Mechanics Conference (CERMA'06) Vol. 2; pp. 309 - 314
Main Authors Ramos, M.J.A., Veloz, G.A., Guzman, R.M.E.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2006
Subjects
Automata
Communication system control
Computational modeling
Computer simulation
Design engineering
Discrete time systems
Discrete transforms
Energy consumption
Mechanical factors
Parallel processing
Online AccessGet full text

Cover

More Information
Summary:Nowadays, technologies are attempting to increase systems speed beyond the limits imposed by the capacity of the systems themselves. That is the case of finite state machines where improving the iteration bound is critical for reaching the desired performance. A good solution to improve them is to parallelize the finite state machines in order to improve their speed. In this paper we propose a methodology that makes use of the Z transform, better known as an important tool for discrete time system characterization. The proposed algorithm, starts from the canonical description of the finite state machine and generates the parallel version of the finite state machine with the desired level of parallelism while preserving its original behavior
ISBN:9780769525693
0769525695
DOI:10.1109/CERMA.2006.116