Circuit Width, Register Allocation, and Ordered Binary Decision Diagrams

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

Volumn 10, Issue 8, 1991, Pages 1059-1066

  Berman, C Leonard ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; DECISION THEORY AND ANALYSIS; LOGIC CIRCUITS, COMBINATORIAL; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

CASCODE TECHNOLOGY; CIRCUIT WIDTH; DIRECTED ACYCLIC GRAPHS; MULTIOUTPUT FUNCTIONS; ORDERED BINARY DECISION DIAGRAMS; REGISTER ALLOCATION;

COMPUTER METATHEORY;

EID: 0026206365     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.85742     Document Type: Article

References (24)

1. C. L. Berman and L. H. Trevillyan, “A global approach to circuit size reduction,” in Proc. Advanced Research in VLSI, 5th MIT Conf., Cambridge, MA, Mar. 28–30, 1988, pp. 203–214.
2. C. E. Leiserson and J. B. Saxe, “Optimizing synchronous systems,” J. VLSI Comput. Syst., vol. 1, no. 1, pp. 41–67, 1983.
3. R. K. Brayton and Curt McMullen, “The decomposition and factorization of Boolean functions,” in Proc. 1982 Int. Symp. on Circuits and Systems, Rome, Italy, June 1982, pp. 49–54.
4. R. E. Bryant, “Graph based algorithms for Boolean function manipulation,” IEEE Trans. Comput., vol. C-35, pp. 677–691, Aug. 1986.
5. L. G. Heller, W. R. Griffin, J. W. Davis, and N. G. Thomas, “Cascode voltage switch logic—A differential logic family,” in Dig. Tech. Papers-31st Int. Solid State Circuits Conf., 1984, pp. 16–17.
6. G. Hachtel and R. Jacoby, “Verification algorithms for VLSI synthesis,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 616–640, May 1988.
7. S. Malik, Albert R. Wang, R. K. Brayton, and A. Sangiovanni-Vincentelli, “Logic verification using binary decision diagrams in a logic synthesis environment,” in Proc. 1CCAD, Nov. 1988.
8. M. Fujita, H. Fujisawa, and N. Kawato, “Evaluation and improvements of Boolean comparison method based on binary decision diagrams,” in Proc. ICCAD, Nov. 1988.
9. C. Y. Lee, “Representation of switching circuits by binary-decision programs,” Bell Syst. Tech. J., vol. 38, pp. 985–999, July 1959.
10. Sheldon B. Akers, “Binary decision diagrams,” IEEE Trans. Comput., vol. C-27, pp. 509–516, June 1978.
11. N. Goncalves and H. DeMan, “NORA: A racefree dynamic CMOS technique for pipelined logic structures,” IEEE J. Solid-State Circuits, vol. SC-18, pp. 261–266, June 1983.
12. S. J. Friedman and K. J. Supowit, “Finding the optimal variable ordering for binary decision diagrams,” in Proc. 24th ACM/IEEE DAC, June 1987, pp. 348–355.
13. R. Nair and D. Brand, “Construction of optimal DCVS trees,” IBM Res. Rep., RC 11863, Mar. 1986.
14. E. L. Lawler, “The minimal synthesis of tree structures,” in Proc. 4th Symp. on Switching Theory and Logical Design, Sept. 1963, pp. 63–82.
15. R. E. Levien, “Determining the best ordering of variables in cascade switching circuits,” in Proc. 4th Symp. on Switching Theory and Logical Design, Sept. 1963, pp. 83–104.
16. Ravi Sethi and J. D. Ullman, “The generation of optimal code for arithmetic expressions,” J. ACM, vol. 17, no. 4, pp. 715–728, 1970.
17. K. Karplus, “Representing Boolean functions with if-then-else dags,” Comput. Eng., UCSC-CRL-88-28, Univ. Calif., Santa Cruz, Dec. 1988.
18. J. C. Madre and J.-P. Billon, “Proving circuit correctness using formal comparison between,” in Proc. DAC, June 1988, pp. 205–210.
19. K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a BDD package,” in Proc. 27th DAC, Orlando, FL, June 1990.
20. G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein, “Register allocation via coloring,” Comput Lang., vol. 6, pp. 47–57, 1981.
21. R. Sethi, “Pebble games for studing storage sharing,” Theoretical Comput. Sci., vol. 19, pp. 69–84, 1982.
22. A. L. Rosenberg and I. H. Sudborough, “Bandwidth and pebbling,” Comput., vol. 31, pp. 115–139, 1983.
23. R. E. Bryant, personal communication, 1988.
24. J. R. Burch, “Using BDDs to verify multipliers,” in Proc. 28th DAC, June 1991.