Optimum and heuristic algorithms for an approach to finite state machine decomposition

@article{Ashar1991OptimumAH,
  title={Optimum and heuristic algorithms for an approach to finite state machine decomposition},
  author={Pranav Ashar and Srinivas Devadas and A. Richard Newton},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
  year={1991},
  volume={10},
  pages={296-310}
}
Techniques have been proposed in the past for various types of finite state machine (FSM) decomposition that use the number of states or edges in the decomposed circuits as the cost function to be optimized. Such measures are not reflective of the true logic complexity of the decomposed circuits. In addition, previous methods have been mainly heuristic in nature and offer limited guarantees as to the quality of the decomposition. In this paper, optimum and heuristic algorithms for the general… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Personal communication

  • J. Bhasker
  • Mar.
  • 1989

Sangiovanni-Vincentelli, h g i c Minimization Algorithms for VLSI Synthesis

  • G. D. Hachtel, Curt McMullen
  • Hingham, MA: Kluwer Academic,
  • 1984

Finite-State Models for Logical Machines

  • F. C. Hennie
  • New York: Wiley,
  • 1968

Similar Papers

Loading similar papers…