Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping
- 72 Downloads
The Walsh transform has numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions that can be transformed. Currently available techniques limit the functions to less than 20 variables. In this paper, we show how to compute concise representations of the Walsh transform for functions with several hundred variables. We have applied our techniques to boolean technology mapping and, in certain cases, we obtained a speed up of as much as 50% for the matching phase.
Unable to display preview. Download preview PDF.
- 1.R.E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, Vol. C-35, No. 8, 1986.Google Scholar
- 2.M.A. Harrison, Introduction to Switching and Automata Theory. McGraw-Hill, 1965.Google Scholar
- 3.S.L. Hurst, D.M. Miller, and J.C. Muzio, Spectral Techniques in Digital Logic. Academic Press, Inc., 1985.Google Scholar
- 4.R.J. Lechner, "A transform approach to logic design," IEEE Transactions on Computers, Vol. C-19, No. 7, 1970.Google Scholar
- 5.F. Mailhot and G. De Micheli, "Technology mapping using boolean matching and don't care sets," In Proceedings of the 1990 European Design Automation Conference, 1990.Google Scholar
- 6.G. De Micheli, David Ku, F. Mailhot, and T.K. Truong, "The olympus synthesis system for digital design," IEEE Design and Test of Computers, Oct. 1990.Google Scholar
- 7.J. Yang and G. De Micheli, "Spectral Techniques for Technology Mapping," Technical Report CSL-TR-91-498, Standford University, Dec. 1991.Google Scholar