Proceedings of 2010 IEEE International Symposium on Circuits and Systems 2010
DOI: 10.1109/iscas.2010.5537093
|View full text |Cite
|
Sign up to set email alerts
|

A highly efficient method for extracting FSMs from flattened gate-level netlist

Abstract: This paper proposes a novel method for extracting Finite State Machines (FSMs) from flattened gate-level netlist. The proposed method which employs a potential state register elimination technique and a two-level FSM separation strategy is highly applicable to control-intensive circuits. The potential state register elimination technique is based on control signal identification whereas the two-level FSM separation strategy is based on enable tree identification and the strongly connected components algorithm.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
29
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 57 publications
(29 citation statements)
references
References 4 publications
0
29
0
Order By: Relevance
“…While any sequential circuit can be trivially viewed as a monolithic FSM, the challenge is to be able to decompose that FSM into a set of smaller FSMs, each of which performs a distinguishable function, thus making the resulting high-level description easier for a human to understand. The recent work by Shi et al [33] is a step in this direction.…”
Section: Related Workmentioning
confidence: 95%
“…While any sequential circuit can be trivially viewed as a monolithic FSM, the challenge is to be able to decompose that FSM into a set of smaller FSMs, each of which performs a distinguishable function, thus making the resulting high-level description easier for a human to understand. The recent work by Shi et al [33] is a step in this direction.…”
Section: Related Workmentioning
confidence: 95%
“…While any sequential circuit can be trivially viewed as a monolithic FSM, the challenge is to be able to decompose that FSM into a set of smaller FSMs, each of which performs a distinguishable function, thus making the resulting highlevel description easier for a human to understand. The recent work by Shi et al [20] is a step in this direction. A key component of our work is to find the input-output signal correspondence between an abstract component and a block in the unknown circuit.…”
Section: Related Workmentioning
confidence: 95%
“…In a case study, Hansen et al [22] described several best-practices for a human analysts to reverse engineer gate-level netlists. Shi et al [23] evaluated a technique to automatically reverse engineer circuitry that control units, i.e. Finite State Machine (FSM) from gatelevel netlists.…”
Section: Gate-level Netlist Reverse Engineeringmentioning
confidence: 99%