Abstract
Now that we have the SOP and POS canonical forms of our logic functions available to us, it’s worth asking ourselves if we can investigate other, simpler, forms. Remember that these equations are essentially the blueprints for the physical device that’s going to be implementing the functions and the more complicated the equations the less efficient the final product is going to be. Therefore, it’s worth considering trying to find the “best” form of the function. We call this the minimal form and the process of finding this form is logic function minimization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Seiffertt, J. (2017). Basic Logic Function Minimization. In: Digital Logic for Computing. Springer, Cham. https://doi.org/10.1007/978-3-319-56839-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-56839-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56837-9
Online ISBN: 978-3-319-56839-3
eBook Packages: Computer ScienceComputer Science (R0)