An Efficient Algorithm for Constrained Encoding and its Applications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 12, Issue 12, 1993, Pages 1813-1826

  Shi, Chuan Jin ^a   Brzozowski, Janusz A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

constrained encoding; local search heuristics; logic synthesis asynchronous circuits; PLA decomposition; state assignment

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; CONSTRAINT THEORY; HEURISTIC PROGRAMMING; LOGIC DESIGN; STATE ASSIGNMENT;

SOFTWARE PACKAGE ENCORE;

SIGNAL ENCODING;

EID: 0027885630     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.251145     Document Type: Article

References (23)

1. J. I. Acha and J. Calvo, “On the implementation of sequential circuits with PLA modules,” Inst. Elect. Eng. Proc., vol. 132, pt. E., no. 5, pp. 246–250, Sept. 1985.
2. R. K. Brayton, G. D. Hatchtel, C. T. McMullen and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. NEws York: Kluwer Academic Publishers, 1984.
3. T. A. Chu, “Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications,” Ph.D. dissertation, MIT, June 1987.
4. S. Devadas and A. R. Newton, “Exact algorithms for output encoding, state assignment, and four-level Boolean minimization,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 13–27, Jan. 1991.
5. S. Devadas, A. R. Wang, A. R. Newton, and A. Sangiovanni-Vincentelli, “Boolean decomposition of programmable logic arrays,” in Proc. IEEE Custom Integrated Circuits Conf., 1988, pp. 2.5.1-2.5.5.
6. T. A. Dolotta and E. J. McCluskey, “The coding of internal states of sequential machines,” IEEE Trans. Elect. Comput., vol. EC-13, pp. 549–562, Oct. 1964.
7. C. M. Fiduccia and R. M. Mattheyses, “A linear-time heuristic for improving network partitions,” in Proc. of ACM/IEEE Design Automation Conf., 1982, pp. 175–180.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Franciscso, CA: Freeman, 1979.
9. G. D. Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli, “Optimal state assignment for finite state machines,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 269–285, July 1985.
10. G. D. Micheli, “Symbolic design of combinational and sequential logic circuits implemented by two-level logic macros,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 597–616, Oct. 1986.
11. R. L. Rudell and A. Sangiovanni-Vincentelli, “Multiple-valued minimization for PLA optimization,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 727–750, Sept. 1987.
12. A. Saldanha, T. Villa, R. K. Brayton, and A. L. Sangiovanni-Vincentelli, “A framework for satisfying input and output encoding constraints,” in Proc. ACM/IEEE Design Automation Conf., 1991, pp. 170–175.
13. G. Saucier, C. Duff and F. Poirot, “State assignement using a new embedding method based on an intersecting cube theory,” in Proc. of ACM/IEEE Design Automation Conf., Las Vegas, June 1989, pp. 321–326.
14. C.-J. Shi, “Constrained via minimization and signed hypergraph partitioning,” in Algorithmic Aspects of VLSI Layouts, eds. D. T. Lee and M. Sarrafzadeh. River Edge, NJ: World Scientific, 1992.
15. C.-J. Shi and J. A. Brzozowski, “An Efficient Algorithm for Constrained Encoding and Its Applications,” Tech. Rep., No. CS-92-20, Dept. Comp. Sci., Univ. of Waterloo, Apr. 1992.
16. C.-J. Shi and J. A. Brzozowski, “Graph-Theoretic Structures of Logic Encoding and Layer Assignment in VLSI Design,” Tech. Rep., Dept. Comp. Sci., Univ. of Waterloo, in preparation.
17. C.-J. Tan, “State assignment for asynchronous sequential machines,” IEEE Trans. Comp., vol. C-20, pp. 382–391, Apr. 1971.
18. J. H. Tracey, “Internal state assignment for asynchronous sequential machines,” IEEE Trans. Electron. Comput., pp. 551–560, Aug. 1966.
19. S. H. Unger, “A row assignment for delay-free realizations of flow tables without essential hazards,” IEEE Trans. Electron. Comput., vol. C-17, pp. 145–158, Feb. 1968.
20. S. H. Unger, Asynchronous Sequential Switching Circuits. New York: Wiley, 1969.
21. T. Villa and A. Sangiovanni-Vincentelli, “NOVA: State assignment of finite state machines for optimal two-level logic implementation,” IEEE Trans. Computer-Aided Design, vol. 9, pp. 905–924, Sept. 1990.
22. D. Varma and E. A. Trachtenberg, “A fast algorithm for the optimal state assignment of large finite state machines,” in Proc. of International Conf. on CAD, 1988, pp. 152–155.
23. S. Yang and M. J. Ciesielski, “Optimum and suboptimum algorithms for input encoding and its relationship to logic minimization,” IEEE Trans. Computer-Aided Design, vol. 10, pp. 4–12, Jan. 1991.