Algebraic Method of Multiplexer Implementation


Introduction Introduction

Examples Examples

Problems Problems


Introduction Introduction

This is an approach where you can transform one boolean expression into a form so that a multiplexer can be implemented.

This can be acheived by applying Boolean Theorems.

Before attempting the design of a multiplexer using the algebraic method, the function to be considered should be minimised using the techniques covered in Minimisation of Boolean Functions.

Minimising the terms and expressions can be important because this allows designers to use the least amount of components and use the most efficient type of multiplexer.


Example Example

Consider the function:
Figure 1

Expanding to standard sum of products form:

Figure 2

The resulting multiplexer implementation is:

Figure 3


Problems Problems

Design multiplexer implementations for the following functions using the algebraic method.

Problems

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