Optimization of microcontrollers by partitioning

Presents a new partitioning method for finite state machines (FSMs). The method is particularly well suited for mu -controller circuits. It consists in grouping the mu -instructions of the control graph into classes according to a compatibility property of the output values. Only one sequence of output values is then generated for all mu -instructions of a given class. The resulting structure is composed of three machines: a state machine which generates the next states, a command machine and a filter machine. The command outputs and the filter outputs are merged via a logical AND to obtain the final outputs. This structure leads to an area reduction of 34% to 65% for the examples presented.<<ETX>>

[1]  Robert K. Brayton,et al.  Optimal State Assignment for Finite State Machines , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Gaetano Borriello,et al.  High-level synthesis: current status and future directions , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[3]  E. F. Girczyc,et al.  HAL: A Multi-Paradigm Approach to Automatic Data Path Synthesis , 1986, 23rd ACM/IEEE Design Automation Conference.

[4]  Srinivas Devadas,et al.  General Decomposition of Sequential Machines: Relationships to State Assignment , 1989, 26th ACM/IEEE Design Automation Conference.

[5]  Narain H. Gehani,et al.  Flex: A High-Level Language for Specifying Customized Microprocessors , 1985, IEEE Transactions on Software Engineering.

[6]  Pierre G. Paulin,et al.  Horizontal Partitioning of PLA-based Finite State Machines , 1989, 26th ACM/IEEE Design Automation Conference.

[7]  Gabriele Saucier,et al.  ASYL: A Rule-Based System for Controller Synthesis , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Gabriele Saucier,et al.  State Assignment Using a New Embedding Method Based on an Intersecting Cube Theory , 1989, 26th ACM/IEEE Design Automation Conference.