• Home
  • Tutorials
  • Interviews
  • Info Seed
  • Forums
  • Projects
  • Links
  • Contact Us
Digital Electronics
NUMBER SYSTEM
BINARY CODES
BOOLEAN ALGEBRA
K MAPS
COMBINATIONAL CKT
INTRODUCTION
ADDER
FULL ADDER(FA)
FA using HAs
BINARY ADDER
SERIAL ADDER
PARALLEL ADDER
CARRY LOOK AHEAD ADDER (CLA)
QUESTION (BCD to Excess-3 using ADDER)
SUBTRACTORS
FULL SUBTRACTOR
FS using HSs
MORE QUESTIONS
SEQUENTIAL CIRCUITS
TIMING CIRCUITS

 

BOOLEAN FUNCTION IMPLEMENTATION USING MUXes-PART II

Another procedure to implement the function using MUX

  • Take one variable for input lines and rest of the term for selection lines.
  • Then list the min terms with the variable selected in complimented form in 1st row and list the
  • The min terms with variable selected in un-complimented form in 2nd row.
  • Then encircle the min terms which are present in the function.
    • If we have no circled variable in the column, then we put 0 on the corresponding line
    • If we have both circled variables, then we put 1 on the line
    • If bottom variable is circled and top is not circled, apply A to input line
    • If bottom variable is not circled and top is circled, apply A’ to input line

e.g. To implement the function F(A, B, C)= Σ (1, 2, 5, 7) using MUX.

Let’s now take the variable A for input lines and B & C for selection lines.

So we list the min terms as follow:

So the circuit is

This is same as the circuit obtained using earlier method.

 

previous next
| Copyright © 2009 exploreroots- All Rights Reserved | Disclaimer |