ACM Home Page
Please provide us with feedback. Feedback
Sequential optimization in the absence of global reset
Full text PdfPdf (300 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 8 ,  Issue 2  (April 2003) table of contents
Pages: 222 - 251  
Year of Publication: 2003
ISSN:1084-4309
Authors
Vigyan Singhal  Tempus-Fugit, Albany, CA
Carl Pixley  Synopsys, Hillsborough, OR
Adnan Aziz  University of Texas at Austin, Austin, TX
Shaz Qadeer  Microsoft, Redmond, WA
Robert Brayton  University of California at Berkeley, Berkeley, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 22,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/762488.762493
What is a DOI?

ABSTRACT

We study the problem of optimizing synchronous sequential circuits. There have been previous efforts to optimize such circuits. However, all previous attempts make implicit or explicit assumptions about the design or the environment of the design. For example, it is widespread practice to assume the existence of a hardware reset line and consequently a fixed power-up state; in the absence of the same, a common premise is that the design's environment will apply an initializing sequence. We review the concept of safe replaceability which does away with these assumptions and the delay-safe replaceability notion, which is applicable when the design's output is not used for a certain number of cycles after power-up. We then develop procedures for optimizing the combinational next-state and output logic, as well as routines for reencoding the state space and removing state bits under these replaceability criteria. Experimental results demonstrate the effectiveness of our algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Berry, G. and Touati, H. J. 1993. Optimized controller synthesis using Esterel. In Workshop Notes of International Workshop on Logic Synthesis (Tahoe City, CA, May).
 
2
Berthet, C., Coudert, O., and Madre, J. C. 1990. New Ideas on symbolic manipulation of finite state machines. In Proceedings of the International Conference on Computer Design (Cambridge, MA, October) 224--227.
 
3
 
4
Brayton, R. K., Hachtel, G. D., and Sangiovanni-Vincentelli, A. L. 1990. Multilevel logic synthesis. Proc. IEEE 78, 2 (Feb.), 264--300.
 
5
Cerny, E. and Marin, M. A. 1977. An approach to unified methodology of combinational switching circuits. IEEE Trans. Comput. 27, 8.
 
6
Cheng, K.-T. 1993. Redundancy removal for sequential circuits without reset states. IEEE Trans. Comput.-Aided Des. Integ. Circ. 12, 1 (Jan.), 13--24.
 
7
Cho, H., Hachtel, G. D., Jeong, S.-W., Plessier, B., Schwarz, E., and Somenzi, F. 1990. ATPG aspects of FSM verification. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, November), 134--137.
 
8
Coudert, O. and Madre, J. C. 1990. A Unified framework for the formal verification of sequential circuits. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, November), 126--129.
 
9
 
10
 
11
Kunz, W. and Pradhan, D. 1994. Recursive learning: A precise implication procedure and its application to test verification and and optimization. IEEE Trans. Comput. Aided Des. Integ. Circ. Syst. (Sept.).
 
12
 
13
Lin, B. 1993. Efficient symbolic support manipulation. In Proceedings of the International Conference on Computer Design (Cambridge, MA, October), 513--516.
 
14
Lin, B., Touati, H. J., and Newton, A. R. 1990. Don't care minimization of multi-level sequential logic networks. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, November), 414--417.
 
15
 
16
 
17
Pixley, C. 1992. A theory and implementation of sequential hardware equivalence. IEEE Trans. Comput.-Aided Des. Integ. Circ. 11, 12 (Dec.), 1469--1494.
 
18
 
19
 
20
 
21
 
22
Saldanha, A., Villa, T., Brayton, R. K., and Sangiovanni-Vincentelli, A. L. 1994. Satisfaction of input and output encoding constraints. IEEE Trans. Comput. Aided Des. Integ. Circ. 13, 5 (May), 589--602.
 
23
Savoj, H. and Brayton, R. K. 1991. Observability relations and observability don't cares. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, November), 518--521.
 
24
Savoj, H., Brayton, R. K., and Touati, H. 1991. Extracting local don't cares for network optimization. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, November), 514--517.
 
25
26
 
27
Shiple, T. R., Singhal, V., Brayton, R. K., and Sangiovanni-Vincentelli, A. L. 1996. Analysis of combinational cycles in sequential circuits. In Proceedings of the International Symposium on Circuits and Systems (Atlanta, May).
 
28
 
29
 
30
 
31
 
32
 
33
Singhal, V., Pixley, C., Aziz, A., and Brayton, R. 2001. A theory of safe replacements for sequential circuits. IEEE Trans. Comput. Aided Des. Integ. Circ. Syst. 20, 2 (Feb.).
 
34
Touati, H., Savoj, H., Lin, B., Brayton, R. K., and Sangiovanni-Vincentelli, A. L. 1990. Implicit state enumeration of finite state machines using BDD's. In Proceedings of the International Conference on Computer-Aided Design (Santa Clara, CA, November), 130--133.
 
35
Villa, T. University of California, Berkeley. Personal communication.

Collaborative Colleagues:
Vigyan Singhal: colleagues
Carl Pixley: colleagues
Adnan Aziz: colleagues
Shaz Qadeer: colleagues
Robert Brayton: colleagues