Technology-driven FSM partitioning for synthesis of large sequential circuits targeting lookup-table based FPGAs

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

Abstract

Different to common approaches we propose a novel Finite State Machine (FSM) partitioning procedure which takes technology-specific features into consideration. Moreover, partitioning and state encoding are performed simultaneously. We discuss the method utilizing the technology of Lookup- Table (LUT)-based FPGAs in detail. Our implementation can be used as an addon for usual FPGA synthesis systems. We inserted this procedure into the FPGA design flow and achieved average area reductions by 38% and saved circuit depth by 29% for large FSM benchmarks.

Cite

CITATION STYLE

APA

Feske, K., Mulka, S., Koegst, M., & Elst, G. (1997). Technology-driven FSM partitioning for synthesis of large sequential circuits targeting lookup-table based FPGAs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1304, pp. 235–244). Springer Verlag. https://doi.org/10.1007/3-540-63465-7_228

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