© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2024
H. H. WardMastering Digital ElectronicsMaker Innovations Serieshttps://doi.org/10.1007/978-1-4842-9878-7_3

3. Simplifying Boolean Expressions

Hubert Henry Ward1  
Leigh, UK

In this chapter we will study how to use Boolean algebra to minimize the logic circuits we design. We will also look at an alternative approach to minimizing logic circuits and Boolean expressions, that is, using Karnaugh maps.

Some Fundamental Identities

Before we look at using Boolean algebra to simplify expressions, we should look at some other aspects of Boolean algebra that are useful to know.

The Inverse Law

will always equal to 0.

This is the AND version of the “Inverse Law.”

To test ...

Get Mastering Digital Electronics: An Ultimate Guide to Logic Circuits and Advanced Circuitry now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.