Approaches to multi-level sequential logic synthesis

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The author presents approaches to multilevel sequential logic synthesis-algorithms and techniques for the area and performance optimization of interconnected finite-state machine descriptions. New techniques are presented for the exploitation of sequential don't cares in arbitrary, interconnected sequential machine structures. Exploiting these don't care sequences can result in significant improvements in area and performance. The author addresses the problem of migrating logic across state machine boundaries so as to make particular machines less complex at the possible expense of making others more complex. This can be useful from both an area and a performance point of view. The author presents novel optimization algorithms that incrementally modify state machine structures across latch boundaries. He discusses the use of more global state machine decomposition and factorization algorithms for area optimization. Finally, he presents experimental results obtained using these algorithms on sequential circuits.

Cite

CITATION STYLE

APA

Devadas, S. (1989). Approaches to multi-level sequential logic synthesis. In Proceedings - Design Automation Conference (pp. 270–276). Publ by IEEE. https://doi.org/10.1145/74382.74428

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free