Skip to main content

A Generation Method For Exor-Sum-of-Products Expressions Using Shared Binary Decision Diagrams

  • Chapter
Logic Synthesis and Optimization

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 212))

Abstract

A new efficient algorithm to generate exor-sum-of-products expressions is presented. The basic idea of the algorithm is to apply the “smallest” expansion among the following 12 expansions for a given logic function repeatedly.

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. Akers, “Binary Decision Diagrams,” IEEE Transactions on Computers, Vol. C-27 No. 6, pp. 509–516, June 1978.

    Article  Google Scholar 

  2. G. Bioul, M. Davio, and J. P. Deschamps, “Minimization of Ring-sum Expansions of Boolean Functions,” Phillips Research Reports, Vol. 28 No. 1, pp. 17–36, Feb. 1973.

    MathSciNet  MATH  Google Scholar 

  3. R. E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Transactions on Computers, Vol. C-35 No. 8, pp. 677–691 Aug. 1986.

    Article  Google Scholar 

  4. S. Minato, N. Ishiura, and S. Yajima, “Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation,” ACM/IEEE Proceedings of 27th Design Automation Conference, pp. 52–57, June 1990.

    Google Scholar 

  5. S. Minato, “Minimum-Width Method of Variable Ordering for Binary Decision Diagrams,” IEICE Transactions on Fundamentals, Vol. E75-A No. 3, pp. 392–399, Mar. 1992.

    Google Scholar 

  6. A. Mukhopadhyay and G. Schmitz, “Minimization of Exclusive Or and Logical Equivalence Switching Circuits,” IEEE Transactions on Computers, Vol. C-19 No. 2, pp. 132–140, Feb. 1970.

    Article  Google Scholar 

  7. G. Papakonstantinou, “Minimization of Modulo-2 Sums of Products,” IEEE Transactions on Computers, Vol. C-28 No. 2, pp. 163–167, Feb. 1979.

    Article  MathSciNet  Google Scholar 

  8. T. Sasao, “EXMIN2: A Tool for Exor Logic Synthesis,” Synthesis and Simulation Meeting and International Interchange, Apr. 1992.

    Google Scholar 

  9. T. Sasao, “Optimization of Multiple-Valued AND-EXOR Expressions Using Multiple-Place Decision Diagrams,” IEEE 22nd International Symposium on Multiple-Valued Logic, pp. 451–458, May 1992.

    Google Scholar 

  10. A. Tran, “Graphical Method for the Conversion of Minterms to Reed-Muller Coefficients and the Minimisation of Exclusive-Or Switching Functions,” IEE Proceedings Part E, Vol. 134 No. 2, pp. 93–99, Mar. 1987.

    MathSciNet  Google Scholar 

  11. X. Wu, X. Chen, and S. L. Hurst, “Mapping of Reed-Muller Coefficients and the Minimisation of Exclusive Or-Switching Functions,” IEE Proceedings Part E, Vol. 129 No. 1, pp. 15–20, Jan. 1982.

    MathSciNet  Google Scholar 

  12. S. Yang, Logic Synthesis and Optimization Benchmarks User Guide Version 3.0, MCNC, Jan. 1991.

    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

Yasuoka, K. (1993). A Generation Method For Exor-Sum-of-Products Expressions Using Shared Binary Decision Diagrams. 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_14

Download citation

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

  • 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