Skip to main content

Efficient Spectral Techniques for Logic Synthesis

  • Chapter
Logic Synthesis and Optimization

Abstract

Spectral methods have been used for logic design for many years. However, their use was limited to the synthesis and optimization of small digital circuits, due to the enormous complexity in computing the spectra of large logic functions. Recent developments in design automation and logic synthesis have prompted a new look at these methods, with emphasis on developing efficient computational procedures so that these powerful but complex methods can be used for the synthesis and optimization of larger logic networks. In this article we review the fundamentals of spectral design methods and present some new techniques that make application of such techniques to practical problems feasible.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.B.Aker “Binary decision diagrams” IEEE Trans. Comput. Vol. C-27. No. 6, June 1978, pp. 509–516.

    Article  Google Scholar 

  2. R.L.Ashenhurst “The decomposition of switching functions,”in Proceedings of an International Symposium on the Theory of Switching pp. 74–116, April 1957.

    Google Scholar 

  3. Ph. W. Besslich and E. A. Trachtenberg, “A three-valued quasi-linear transformation for logic synthesis”, in Spectral techniques: Theory and applications, Ed. C. Moraga and R. Creutzburg, Elsevier, North Holland, 1992.

    Google Scholar 

  4. Ph. B. Besslich “On the Walsh-Hadamard transform and prime implicant extraction”, IEEE Trans. Electromagnetic Compat Vol. EMC-20, No. 4, Nov. 1978, pp. 516–519.

    Google Scholar 

  5. R. K. Brayton et.al., Logic minimization algorithms for VLSI synthesis, Kluwer Academic, Boston, 1984.

    Book  MATH  Google Scholar 

  6. R.E.Bryant “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Comput. Vol. C-35, No. 8 Aug. 1986, pp. 677–691.

    Google Scholar 

  7. T. Damarla and M. G. Karpovsky, “Reed-Muller spectral techniques for fault detection”, Second international workshop on spectral techniques, Ecole Polytechnique de Montreal, Canada, Oct. 1986.

    Google Scholar 

  8. N.DiToro The sign transform’s application to fault detection in digital circuits and its efficient implementation, Master’s Thesis, Drexel University, Philadelphia, March 1991.

    Google Scholar 

  9. K.D.Heidtmann “Arithmetic spectrum applied to fault detection for combinational networks” IEEE Trans. on Computers Vol. 40, No. 3, March 1991, pp. 320–324.

    Article  Google Scholar 

  10. S. L. Hurst, D. M. Miller and J. C. Muzio, Spectral techniques in digital logic, Academic Press, London, 1985.

    Google Scholar 

  11. M. G. Karpovsky, Finite orthogonal series in the design of digital devices, John Wiley, New York, 1976.

    MATH  Google Scholar 

  12. M. G. Karpovsky, Ed., Spectral techniques and fault detection, Academic Press, Orlando, 1985.

    MATH  Google Scholar 

  13. R. Lechner, “Harmonic analysis of switching functions”, in Recent developments in switching theory, A. Mukhopadhyay, Ed., Academic Press, New York, 1971, pp. 121–228.

    Google Scholar 

  14. P. Nagajara and M. G. Karpovsky, “Optimal robust compression of test responses”, IEEE Trans. Computers, Vol. 39, No. 1, Jan. 1990, pp. 138–141.

    Article  Google Scholar 

  15. S.M.Reddy “Easily testable realizations for logic functions”IEEE Trans. Com puters Vol. C-21, Nov. 1972, pp. 1183–1188.

    Google Scholar 

  16. V.M.Tokmen “Disjoint decomposability of multiple valued functions by spectral means”,in Proc. IEEE 10th Int. Symp. Mult. Valued Logic 1980, pp. 88–93.

    Google Scholar 

  17. D. Varma and E. A. Trachtenberg, “A fast algorithm for the optimal state assignment of large finite state machines”, in ICCAD Dig. Tech. Papers, Santa Clara, CA, 1988, pp. 152–155.

    Google Scholar 

  18. D. Varma and E. A. Trachtenberg, “Design automation tools for efficient implementation of logic functions by decomposition,” IEEE Transactions on CAD, CAD-8, Aug. 1989, pp. 901–916.

    Google Scholar 

  19. D.Varma and E.A.Trachtenberg Trachtenberg, “On the estimation of logic complexity for design automation applications”, in Proc. ICCD,New York, 1990.

    Google Scholar 

  20. D. Varma and E. A. Trachtenberg, “Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations,” IEE Proceedings-E, Vol. 138, No. 2, March 1991, pp. 85–92.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Varma, D., Trachtenberg, E.A. (1993). Efficient Spectral Techniques for Logic Synthesis. In: Sasao, T. (eds) Logic Synthesis and Optimization. The Kluwer International Series in Engineering and Computer Science, vol 212. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3154-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3154-8_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6381-1

  • Online ISBN: 978-1-4615-3154-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics