Algebraic Manipulation of Boolean Expressions

Introduction Introduction

Examples Examples

Problems Problems

Introduction Introduction

 This is an approach where you can transform one boolean expression into an equivalent expression by applying Boolean Theorems.

Minimising terms and expressions can be important because electrical circuits consist of individual components that are implemented for each term or literal for a given expression. This allows designers to make use of fewer components, thus reducing the cost of a particular system.

It should be noted that there are no fixed rules that can be used to minimise a given expression. It is left to an individuals ability to apply Boolean Theorems in order to minimise a function.

Example Example

Problems Problems
  1. Minimise the following functions using algebraic method:
    Z = f(A,B,C) = + B + AB + AC
    Z = f(A,B,C) = B + B + BC + A

  2. Minimise the following switch circuit:
Click here for answers.
Previous Next Previous Index Map
To submit your questions and queries please click here: Queries
Composed by David Belton - April 98