Skip to main content

Boolean Arithmetic Polynomials and Equivalence Checking

  • Conference paper
  • First Online:
Emerging Research in Electronics, Computer Science and Technology

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 248))

  • 2248 Accesses

Abstract

Boolean arithmetic polynomials are used for the combinational equivalence checking problem in this tutorial paper. Boolean arithmetic polynomial multiplication methods are presented. Several methods for equivalence checking are discussed, including nonconventional methods.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Similar content being viewed by others

References

  1. Bryant RE (1986) Graph-based algorithms for Boolean function manipulation. IEEE TC C-35(8):677–691

    Google Scholar 

  2. Brand D (1993) Verification of large synthesized designs. In: Proceedings of international conference on CAD, pp 534–537

    Google Scholar 

  3. Marques-Silva J, Sakallah KA (1996) GRASP: a new search algorithm for satisfiability. In: IEEE/ACM international conference on CAD, pp 220–227

    Google Scholar 

  4. Zhegalkin II (1927) On the technique of calculating propositions in symbolic logic. Matematicheskii Sbornik 43:9–28

    Google Scholar 

  5. Schneeweiss WG (1998) On the polynomial form of Boolean functions: derivations and applications. IEEE Trans Comput 47(2):217–221

    Article  MathSciNet  Google Scholar 

  6. Falkowski BJ (1999) A note on the polynomial form of Boolean functions and related topics. IEEE Trans Comput 48(8):860–864

    Article  MathSciNet  Google Scholar 

  7. Mishchenko A, Chatterjee S, Brayton R, Een N (2006) Improvements to combinational equivalence checking. In: Proceedings of ICCAD 2006, pp 836–847

    Google Scholar 

  8. Falkowski BJ (1999) Relationship between arithmetic and Haar wavelet transforms in the form of layered Kronecker matrices. Elect Let 35(10):799–800

    Article  Google Scholar 

  9. Akers S (1959) On a theory of Boolean functions. SIAM J 7:487–498

    MATH  Google Scholar 

  10. Kaltofen E (1985) Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. SIAM J Comput 14:469–489

    Article  MathSciNet  MATH  Google Scholar 

  11. Zilic Z, Radecka K (2009) Enabling practical uses of arithmetic transform: a comprehensive analysis. Proceedings of 9th international workshop on Reed-Muller transform and its applications, RM’09

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rajkumar Vedam .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Vedam, R. (2014). Boolean Arithmetic Polynomials and Equivalence Checking. In: Sridhar, V., Sheshadri, H., Padma, M. (eds) Emerging Research in Electronics, Computer Science and Technology. Lecture Notes in Electrical Engineering, vol 248. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1157-0_77

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1157-0_77

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1156-3

  • Online ISBN: 978-81-322-1157-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics