EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition

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

Volumn 13, Issue 8, 1994, Pages 959-975

  Lai, Yung Te ^a   Pedram, Massoud ^a   Vrudhula, Sarma B K ^a  

^a Yamamoto Mfg U S A Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); EQUIVALENCE CLASSES; FORMAL LOGIC; FUNCTION EVALUATION; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS;

EDGE VALUED BINARY DECISION DIAGRAMS; FUNCTION DECOMPOSITION; INTEGER LINEAR PROGRAMMING; LOGIC VERIFICATION; ORDERED BINARY DECISION DIAGRAMS; SPECTRAL TRANSFORMATION;

BOOLEAN FUNCTIONS;

EID: 0028483037     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.298033     Document Type: Article

References (47)

1. R. L. Ashenhurst The decomposition of switching functions 29 74 116 1959 Ann. Computation Lab., Harvard Univ.
2. E. Balas An additive algorithm for solving linear programs with zero-one variables Operations Research 13 4 517 546 1965
3. E. Balas Encyclopedia of Computer Science and Technology 2 479 494 1975 M. Dekker New York Bivalent programming by implicit enumeration
4. E. Balas Disjunctive programming Annals of Discrete Mathematics 5 3 51 1979
5. M. Benichou J. M. Gauthier P. Girodet G. Hentges G. Ribiere O. Vincent Experiments in mixed-integer linear programming Math. Programming 1 76 94 1971
6. M. Beardslee B. Lin A. Sangiovanni-Vincentelli Communication based logic partitioning Proc. European Design Automation Conf. 32 37 Proc. European Design Automation Conf. 1992
7. V. J. Bowman J. H. Starr Annals of Discrete Mathematics 1 99 116 1977 North-Holland Partial orderings in implicit enumeration
8. R. E. Bryant Graph-based algorithms for Boolean function manipulation IEEE Trans. Comput. C-35 8 677 691 Aug. 1986
9. S-C. Chang M. Marek-Sadowska Technology mapping via transformations of function graph Proc. Int. Conf. Computer-Aided Design 159 162 Proc. Int. Conf. Computer-Aided Design 1992
10. E. M. Clarke M. Fujita P. C. McGeer K. L. McMillan J. C.-Y. Yang Multi-terminal binary decision diagrams: An efficient data structure for matrix representation Int. Workshop on Logic Synthesis 6a: 1 15 Int. Workshop on Logic Synthesis 1993-May
11. E. M. Clarke K. L. McMillan X. Zhao M. Fujita J. C.-Y. Yang Spectral transforms for large Boolean functions with applications to technology mapping Proc. 30th Design Automation Conf. 54 60 Proc. 30th Design Automation Conf. 1993
12. H. A. Curtis A new approach to the design of switching circuits 1962 Van Nostrand NJ, Princeton
13. R. J. Dakin A tree-search algorithm for mixed integer programming problems Comput. J. 9 250 255 1965
14. G. B. Dantzig Linear Programming and Extensions 1963 Princeton Univ. Press NJ, Princeton
15. N. J. Driebeck An algorithm of the solution of mixed integer programming problems Management Sci. 22 576 587 1966
16. C. R. Edwards The application of the Rademacher-Walsh transform to Boolean function classification and threshold-logic synthesis IEEE Trans. Comput. C-24 48 62 1975
17. B. J. Falkowski I. Schafer M. A. Perkowski Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions IEEE Trans. Computer-Aided Design 11 10 1207 1226 Oct. 1992
18. M. R. Garey D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco
19. R. E. Gomory Combinatorial Analysis 211 216 1960 American Mathematical Society Solving linear programming problems in integers
20. G. D. Hachtel F. Somenzi A symbolic algorithm for maximum flow in 0-1 networks Int. Workshop on Logic Synthesis 6b: 1 6 Int. Workshop on Logic Synthesis 1993-May
21. P. L. Hammer S. Rudeanu Boolean Methods in Operations Research and Related Areas 1968 Springer Verlag Heidelberg
22. P. L. Hammer B. Simeone Annals of Discrete Mathematics 31 83 112 1987 North-Holland Order relations of variables in 0-1 programming
23. S. L. Hurst D. M. Miller J. C. Muzio Spectral Techniques in Digital Logic 1985 Academic London
24. T. Ibaraki The power of dominance relations in branch and bound algorithm J. Assoc. Comput. Mach. 24 264 279 1977
25. S-W. Jeong F. Somenzi A new algorithm for 0-1 programming based on binary decision diagrams Logic Synthesis Workshop 177 184 Logic Synthesis Workshop Japan 1992
26. N. Karmarkar A new polynomial-time algorithm for linear programming Combinatorica 4 373 395 1984
27. Y-T. Lai S. Sastry Edge-Valued binary decision diagrams for multi-level hierarchical verification Proc. 29th Design Automation Conf. 608 613 Proc. 29th Design Automation Conf. 1992
28. Y-T. Lai S. Sastry M. Pedram Boolean matching using binary decision diagrams with applications to logic synthesis and verification Proc. Int. Conf. Computer Design 452 458 Proc. Int. Conf. Computer Design 1992
29. Y-T. Lai M. Pedram S. Sastry BDD based decomposition of logic functions with application to FPGA synthesis Proc. 30th Design Automation Conf. 642 647 Proc. 30th Design Automation Conf. 1993
30. Y-T. Lai M. Pedram S. Vrudhula Edge-Valued Binary-Decision Diagrams: Theory and Applications Aug. 1993 93-31 Univ. of Southern California
31. Y-T. Lai K-R. Pan M. Pedram S. Vrudhula FGMap: A Technology Mapping Algorithm for Look-Up Table Type FPGAs based on Function Graphs Int. Workshop on Logic Synthesis Int. Workshop on Logic Synthesis 1993
32. Y-T. Lai Logic Verification and Synthesis using Function Graphs Dec. 1993 Univ. of Southern Calif.
33. A. H. Land A. G. Doig An automatic method for solving discrete programming problems Econometrica 28 497 520 1960
34. A. Land S. Powell Annals of Discrete Mathematics 5 221 269 1979 North-Holland Computer codes for problems of integer programming
35. H-T. Liaw C-S Lin On the {OBDD}-representation of general Boolean functions IEEE Trans. Comput. C-41 6 661 664 June 1992
36. G. Mitra Investigation of some branch and bound strategies for the solution of mixed integer linear programs Math. Programming 4 155 170 1973
37. L. G. Mitten Branch-and-bound methods: General formulation and properties Operations Research 18 24 34 1970
38. G. L. Nemhauser L. A. Wolsey Integer and Combinatorial Optimization 1988 Wiley New York
39. J. P. Roth R. M. Karp Minimization over Boolean graphs IBM J. 227 238 Apr. 1962
40. T. Sasao Logic Synthesis and Optimization 233 258 1993 Kluwer Academic Publishers FPGA design by generalized functional decomposition
41. L. Schrage Linear, Integer and Quadratic Programming with LINDO 1986 Scientific Press
42. J. F. Shapiro Annals of Discrete Mathematics 5 113 138 1979 North-Holland A survey of lagrangian techniques for discrete optimization
43. K. Spielberg Annals of Discrete Mathematics 5 139 183 1979 North-Holland Enumerative methods in integer programming
44. H. A. Taha Mathematical Programming for Operations Researchers and Computer Scientists 41 69 1981 Marcel Derrer Integer programming
45. D. Varma E. A. Trachtenberg Design automation tools for efficient implementation of logic functions by decomposition IEEE Trans. Computer-Aided Design 8 8 901 916 Aug. 1989
46. J. S. Wallis Hadamard matrices 292 1972 Springer-Verlag New York