Abstract
Except for the procedure EXPAND, all our algorithms are based on a single fundamental strategy: a recursive divide and conquer. Examples of the use of this strategy applied to logic function manipulation can be found in papers by Morreale [MOR 70] and by Hong and Ostapko [HON 72]. The decomposition is based on the Shannon expansion [SHA 48]. The Shannon expansion makes use of the cofactor of a logic function. Since we are dealing primarily with matrix representations and covers, we will give the definition of cofactor for representations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1984 Kluwer Academic Publishers
About this chapter
Cite this chapter
Brayton, R.K., Hachtel, G.D., McMullen, C.T., Sangiovanni-Vincentelli, A.L. (1984). Decomposition and Unate Functions. In: Logic Minimization Algorithms for VLSI Synthesis. The Kluwer International Series in Engineering and Computer Science, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2821-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2821-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9784-0
Online ISBN: 978-1-4613-2821-6
eBook Packages: Springer Book Archive