Abstract
The dream of generating efficient logic implementations from higher level specifications originated with the works of Boole,[57] Shannon [58], Quine and McCluskey[35, 36]. Interest in logic synthesis grew during the 60’s and 70’s, as the computers being designed became more complex. Although many theoretical advances were made, the first examples of practical synthesis did not occur until the later 70’s. Programmable logic arrays, PLAs, were minimized with the program, MINI, [15] and used on many product chips in IBM. LSS[10, 9] was the first example of production synthesis of gate array chips. It was based on local transformations and compiler techniques for optimizing logic, mapping gates to a specific technology. It was used on hundreds of product chips in IBM and was rewritten later with many significant refinements as BooleDozer[11]. These optimization methods were also used in the first offerings from Synop-sys[12, 13], a company formed in 1986 (originally Optimal Solutions) to market synthesis technology developed at General Electric. Synopsys succeeded in bringing synthesis to the commercial market enabling a dramatic advance in design productivity. The years that followed saw many important developments that produced improvements in execution speed, quality of results and ability to deal with real technologies. Today, logic synthesis is a critical part of almost all chip development projects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. K. Brayton, G. D. Hachtel, C. T. McMullen and A. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Springer Science+Business Media New York, 1984.
R. K. Brayton and C. McMullen. The Decomposition and Factorization of Boolean Expressions. Proceedings of the International Symposium on Circuits and Systems, May 1982.
R. K. Brayton, G. D. Hachtel, and A. L. Sangiovanni- Vincentelli. Multilevel Logic Sythesis. Proceedings of the IEEE, vol.78, pages 264–300, Feb. 1990.
R. Brayton, E. Detjens, S. Krishna, T. Ma, P. McGeen, L. Pei, N. Phillips, R. Rudell, R. Segal, A. Wang, R. Yung, A. Sangiovanni- Vincentelli. Multiple-level logic optimization system ICCAD 1986, pp 356–359.
R. Brayton, R. Rudell, A. L. Sangiovanni-Vincentelli, and A. Wang. MIS: A Multiple-Level Logic Optimization System. IEEE Transactions on Computer-Aided Design, pages 1062–1081, November 1987.
L. Berman and L. Trevillyan. Improved Logic Optimization Using Global Flow Analysis Extended Abstract. ICCAD 1988.
Jason Cong, Yuzheng Ding. An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. ICCAD 1992, pages 48–53.
O. Coudert, H. Fraisse and J. C. Madre. Towards a symbolic logic minimization algorithm. The Proceedings of the VLSI Design 1993 Conference, pages 329–334, Jan. 1993.
John A. Darringer, Daniel Brand, John V. Gerbi, William H. Joyner Jr., Louise Trevillyan. LSS: A System for Production Logic Synthesis. IBM Journal of Research and Development, pages 537–545, Sept. 1984.
J. A. Darringer, J. W. Joyner, C. Berman, L. Trevillyan. Logic Syntesis Through Local Transformations. IBM Journal of Research and Development, Vol. 25, no.4., July 1981.
L. Stok, D. S. Kung, D. Brand, A. D. Drumm, A. J. Sullivan, L. N. Reddy, N. Hieter, D. J. Geiger, H. H. Chao, and P. J. Osier. BooleDozer: Logic Synthesis for ASICs. IBM Journal of Research and Development, vol. 40, no. 4, pp. 407–430, July 1996.
A. J. deGeus and W. Cohen. A Rule-Based System for Optimizing Combinational Logic. IEEE Design and Test, pages 22–32 August 1985.
D. Gregory, K. Bartlett, A. J. deGeus. Automatic Generation of Combinatorial Logic from a Functional Specification. Proc. 1985 Int. Symp. on Circ. and Syst., Kyoto, Japan, June 1985.
C. M. Hoffman and M. J. O’Donnell. Pattern Matching in Trees. Journal of the Association for Computing Machinery, pages 68–95, January 1982.
S. J. Hong, R. G. Cain, D. L. Ostapko. MINI: A Heuristic Approach for Logic Minimization. IBM Journal of Research and Development, pages 443–458,1974.
D. Jongeneel, R. Otten, Y. Watanabe, R. K. Brayton. Area and Search Space Control for Technology Mapping. Proceedings 2000 Design Automation Conference 37th DAC, pages 86–91, June 2000.
K. Keutzer and D. Richards. Computational complexity of logic synthesis and optimization. Proceedings of International Workshop on Logic Synthesis, May 1989.
K. Keutzer. Technology binding and local optimization by dag mapping. Proceedings of the 24th ACM/IEEE Design Automation Conference, pages 341–347, June 1987.
Y. Kukimoto, R. K. Brayton, P. Sawkar. Delay-optimal technology mapping by dag covering. Proceedings of the 35th ACM/IEEE Design Automation Conference, June 1998.
E. Lehman, Y. Watanabe, J. Grodstein, H. Harkness. Logic Decomposition during Technology Mapping. ICCAD 1995.
P. McGeer, J. Sanghavi, R. Brayton and A. Sangiovanni-Vincentelli. Espresso-signature: a new exact minimizer for logic functions. Transactions of VLSI, pages 432–440, Dec. 1993.
R Rudell and A Sangiovanni-Vincentelli. Espresso-MV: Algorithms for multiple-valued logic minimization. Proceedings of the IEEE 1985 Custom Integrated Circuits Conference, pages 230–4, May, 1985.
R. Rudell, and A. L. Sangiovanni-Vincentelli. Exact Minimization of Multiple-Valued Functions. ICCAD 1986, pp. 352–355
R. L. Rudell and A. Sangiovanni-Vincentelli. Multiple-valued minimization for PLA optimization. IEEE Transaction on CAD, 1988.
E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Sayoj, P. R. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. SIS: A System for Sequential Circuit Synthesis. Technical Report UCB/ERL M92/41, Electronics Research Laboratory, University of California, Berkeley, CA 94720, May 1992.
J. Vasudevamurthy and J. Rajski. A Method for Concurrent Decomposition and Factorization of Boolean Expressions ICCAD 1990.
Randal E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computing, pages 677–691, Aug. 1986.
P. McGeer and R. K. Brayton, Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network, Circuits and Systems, Design Automation Conference, June 1989.
J. P. Marques-Silva and K. A. Sakallah. GRASP: A New Search Algorithm for Satisfiability, Proceedings of the ACM/IEEE International Conference on Computer-Aided Design pp. 220–227, November 1996.
G. De Micheli, Performance-Oriented Synthesis in the Yorktown Silicon Compiler, ICCAD, pages 138–141 Nov. 1986.
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver, Proc. of the Design Automation Conference, pp. 530–535, June 2001.
K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient implementation of a BDD package. Design Automation Conf., pages 40–45, June 1990.
H.-C. Chen and D. Du. Path Sensitization in Critical Path Problem. Proceedings of Iut’l Conference on Computer-Aided Design, pages 208–211, November 1991.
S. Devadas, K. Keutzer, and S. Malik. Delay computation for combinational logic circuits: theory and algorithms IEEE International Conference on Computer-Aided Design, Nov. 1991.
W. V. Quine. The problem of simplifying truth functions, American Mathematical Monthly, vol. 59 no. 8, pp. 521–531, Oct. 1952.
E. J. McCluskey, Jr., Minimization of Boolean Functions, Bell System Tech. J., vol. 35 no. 6, pp. 1417–1444, Nov. 1956.
R. K. Brayton, G. D. Hachtel, L. Hemachandra, R. Newton and A. Sangiovanni- Vincen-telli, A Comparison of Logic Minimization Strategies Using ESPRESSO: An APL Program Package for Partitioned Logic Minimization, Proceedings of the International Symposium on Circuits and Systems, pages 42–48, Rome Italy, April 1982.
L. Lavagno, S. Malik, R. K. Brayton and A. Sangiovanni-Vincentelli, MIS-MV: Optimization of Multi-Level Logic with Multiple-valued Inputs, Proc. of ICCAD, pp. 560–563, November 1990.
H. Savoj and R. K. Brayton, Observability Relations and Observability Don’t Cares, ICCAD, November 1991.
R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, Multi-Level Logic Optimization and the Rectangle Covering Problem ICCAD Nov. 1987
S. Yamashita, H. Sawada, and A. Nagoya A New Method to Express functional Permissibilities for LUT based FPGAs and Its Applications ICCAD Nov. 1996
S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, The Transduction Method - Design of Logic Networks based on Permissible Functions IEEE Trans., on Comp., Oct., 1989.
M. Gao, J.-H. Jiang, Y. Jiang, Y. Li, S. Sinha, and R. Brayton, MVSIS, International Workshop on Logic Synthesis June 2001
R. Marculescu, D. Marculescu, and M. Pedram Switching Activity Analysis Considering Spatiotemporal Correlations ICCAD Nov. 1994.
G. De Micheli, R. Brayton, and A. Sangiovanni-Vincentelli. KISS: A Program for Optimal State Assignement for FSMs, ICCAD Nov. 1984.
K.-T. Cheng and Luis A. Entrena, Multi-Level Logic Optimization by Redundancy Addition and Removal, Proc. European Conf. on Design Automation, pages 373–377, Feb. 1993.
W. Kunz and D. K. Pradhan, Recursive Learning: An Attractive Alternative to the Decision Tree for Test Generation Digital Circuits Proc. Int’l Test Conference pages 816–825, October 1992.
Carl Pixley Calculating Resetability and Reset Sequences ICCAD Nov. 1991
E. M. Sentovich and R. K. Brayton Don’t Cares and Global Flow Analysis of Boolean Networks ICCAD, Nov. 1988
Chih-Wei Chang and Malgorzata Marek-Sadowska. Single-Pass Redundancy Addition and Removal, ICCAD, pages 606–609, Nov. 2001
L. Trevillyan, W. Joyner and L. Berman Global Flow Analysis in Automatic Logic Design IEEE Trans. on Comp. Jan. 1986
D. Brand Redundancy and Don’t Cares in Logic Synthesis IEEE Trans. on Comp. Oct. 1983
Kwang-Ting Cheng, Srinivas Devadas and Kurt Keutzer. Robust Delay-Fault Test Generation and Synthesis for Testability Under A Standard Scan Design Methodology. DAC, pages 80–86, June 1991: 80–86
Alexander Saldanha, Robert K. Brayton and Alberto L. Sangiovanni-Vincentelli. Equivalence of Robust Delay-Fault and Single Stuck-Fault Test Generation. DAC, pages 173–176, June 1992
Kurt Keutzer, Sharad Malik and Alexander Saldanha. Is Redundancy Necessary to Reduce Delay. DAC, pages 228–234, June 1990
E. Lehman, Y. Watanabe, J. Grodstein and H. Harkness, Logic Decomposition During Technology Mapping, IEEE Transactions on CAD/ICAS, Vol. 16, No. 8, pp. 813–834, August 1997
G. Boole. An Investigation of the Laws of Thought, on which are founded the Mathematical Theories of Logic and Probabilities London: Walton andMoberly. 1854
Shannon, C.E. A symbolic analysis of relay and switching circuits. Transactions of the American Institute of Electrical Engineers pages 713–723, 1938
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brayton, R.K., Darringer, J.A. (2003). Logic Synthesis Overview. In: Kuehlmann, A. (eds) The Best of ICCAD. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0292-0_14
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0292-0_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5007-1
Online ISBN: 978-1-4615-0292-0
eBook Packages: Springer Book Archive