2015
DOI: 10.1109/tcsi.2014.2373031
|View full text |Cite
|
Sign up to set email alerts
|

Selective State Retention Power Gating Based on Formal Verification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
7
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…However, this method requires a formal representation of the entire design, which is not always available, and also no automated techniques are proposed. The two recently published SSRPG approaches introduced by [16,17] provide pure formal methods for automatic selecting of all the FF's, which require retention and are essential for a proper system recovery upon power-up. Experimental results show a significant reduction of about 80% of the retention cells area overhead.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, this method requires a formal representation of the entire design, which is not always available, and also no automated techniques are proposed. The two recently published SSRPG approaches introduced by [16,17] provide pure formal methods for automatic selecting of all the FF's, which require retention and are essential for a proper system recovery upon power-up. Experimental results show a significant reduction of about 80% of the retention cells area overhead.…”
Section: Introductionmentioning
confidence: 99%
“…Recent SSRPG techniques can be efficiently applied to new modern SoC designs for automatic selection and formal validation of essential FFs requires retention. The current work is based on our previous formal SSRPG approach presented in [17], which utilizes formal verification methods and therefore can be easily implemented using the new proposed physical design flow.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Greenberg et al recently proposed methods [9,10] for automatically classifying all the flip-flops (FFs) of a given design into two categories: essential FF (e-FF) and redundant FF (r-FF). [10] performs the analysis according to read/write criteria on the synthesized gate-level netlist with Binary Decision Diagram (BDD) as the data structure, while [9] represented the criteria as a set of formal properties using propositional formulas and then uses common formal verification tools to drive the identification of the e-FFs. Even though the proposed approaches are formally sound, they are difficult to be applied by nonformal experts due to the required effort to provide proper input constraints using BDDs.…”
mentioning
confidence: 99%
“…In addition, They need massive parallel processing to achieve reasonable runtime, leaving scalability a major concern. Compared with [9,10], our proposed method verifies power intention and retention scheme in the early phase of design flow by symbolic simulation [4,5], which allows us to handle not only gate-level but also RTL designs without logic synthesis. Performing the analysis at the RTL instead of gate-level makes it easier for the designer to inspect the results.…”
mentioning
confidence: 99%