
- Digital Electronics - Home
- Digital Electronics Basics
- Types of Digital Systems
- Types of Signals
- Logic Levels And Pulse Waveforms
- Digital System Components
- Digital Logic Operations
- Digital Systems Advantages
- Number Systems
- Number Systems
- Binary Numbers Representation
- Binary Arithmetic
- Signed Binary Arithmetic
- Octal Arithmetic
- Hexadecimal Arithmetic
- Complement Arithmetic
- Base Conversions
- Base Conversions
- Binary to Decimal Conversion
- Decimal to Binary Conversion
- Binary to Octal Conversion
- Octal to Binary Conversion
- Octal to Decimal Conversion
- Decimal to Octal Conversion
- Hexadecimal to Binary Conversion
- Binary to Hexadecimal Conversion
- Hexadecimal to Decimal Conversion
- Decimal to Hexadecimal Conversion
- Octal to Hexadecimal Conversion
- Hexadecimal to Octal Conversion
- Binary Codes
- Binary Codes
- 8421 BCD Code
- Excess-3 Code
- Gray Code
- ASCII Codes
- EBCDIC Code
- Code Conversion
- Error Detection & Correction Codes
- Logic Gates
- Logic Gates
- AND Gate
- OR Gate
- NOT Gate
- Universal Gates
- XOR Gate
- XNOR Gate
- CMOS Logic Gate
- OR Gate Using Diode Resistor Logic
- AND Gate vs OR Gate
- Two Level Logic Realization
- Threshold Logic
- Boolean Algebra
- Boolean Algebra
- Laws of Boolean Algebra
- Boolean Functions
- DeMorgan's Theorem
- SOP and POS Form
- POS to Standard POS Form
- Minimization Techniques
- K-Map Minimization
- Three Variable K-Map
- Four Variable K-Map
- Five Variable K-Map
- Six Variable K-Map
- Don't Care Condition
- Quine-McCluskey Method
- Min Terms and Max Terms
- Canonical and Standard Form
- Max Term Representation
- Simplification using Boolean Algebra
- Combinational Logic Circuits
- Digital Combinational Circuits
- Digital Arithmetic Circuits
- Multiplexers
- Multiplexer Design Procedure
- Mux Universal Gate
- 2-Variable Function Using 4:1 Mux
- 3-Variable Function Using 8:1 Mux
- Demultiplexers
- Mux vs Demux
- Parity Bit Generator and Checker
- Comparators
- Encoders
- Keyboard Encoders
- Priority Encoders
- Decoders
- Arithmetic Logic Unit
- 7-Segment LED Display
- Code Converters
- Code Converters
- Binary to Decimal Converter
- Decimal to BCD Converter
- BCD to Decimal Converter
- Binary to Gray Code Converter
- Gray Code to Binary Converter
- BCD to Excess-3 Converter
- Excess-3 to BCD Converter
- Adders
- Half Adders
- Full Adders
- Serial Adders
- Parallel Adders
- Full Adder using Half Adder
- Half Adder vs Full Adder
- Full Adder with NAND Gates
- Half Adder with NAND Gates
- Binary Adder-Subtractor
- Subtractors
- Half Subtractors
- Full Subtractors
- Parallel Subtractors
- Full Subtractor using 2 Half Subtractors
- Half Subtractor using NAND Gates
- Sequential Logic Circuits
- Digital Sequential Circuits
- Clock Signal and Triggering
- Latches
- Shift Registers
- Shift Register Applications
- Binary Registers
- Bidirectional Shift Register
- Counters
- Binary Counters
- Non-binary Counter
- Design of Synchronous Counter
- Synchronous vs Asynchronous Counter
- Finite State Machines
- Algorithmic State Machines
- Flip Flops
- Flip-Flops
- Conversion of Flip-Flops
- D Flip-Flops
- JK Flip-Flops
- T Flip-Flops
- SR Flip-Flops
- Clocked SR Flip-Flop
- Unclocked SR Flip-Flop
- Clocked JK Flip-Flop
- JK to T Flip-Flop
- SR to JK Flip-Flop
- Triggering Methods:Flip-Flop
- Edge-Triggered Flip-Flop
- Master-Slave JK Flip-Flop
- Race-around Condition
- A/D and D/A Converters
- Analog-to-Digital Converter
- Digital-to-Analog Converter
- DAC and ADC ICs
- Realization of Logic Gates
- NOT Gate from NAND Gate
- OR Gate from NAND Gate
- AND Gate from NAND Gate
- NOR Gate from NAND Gate
- XOR Gate from NAND Gate
- XNOR Gate from NAND Gate
- NOT Gate from NOR Gate
- OR Gate from NOR Gate
- AND Gate from NOR Gate
- NAND Gate from NOR Gate
- XOR Gate from NOR Gate
- XNOR Gate from NOR Gate
- NAND/NOR Gate using CMOS
- Full Subtractor using NAND Gate
- AND Gate Using 2:1 MUX
- OR Gate Using 2:1 MUX
- NOT Gate Using 2:1 MUX
- Memory Devices
- Memory Devices
- RAM and ROM
- Cache Memory Design
- Programmable Logic Devices
- Programmable Logic Devices
- Programmable Logic Array
- Programmable Array Logic
- Field Programmable Gate Arrays
- Digital Electronics Families
- Digital Electronics Families
- CPU Architecture
- CPU Architecture
Two-Variable Function Using 4:1 Multiplexer
Read this chapter to learn how you can implement a two-variable Boolean function using a 4:1 multiplexer. Let's start with a brief introduction of two-variable Boolean functions and multiplexers.
What is a Two-Variable Boolean Function?
A two variable Boolean function is a logical expression which has two input variables. Where, each variable can take either a binary 0 or a binary 1 as its value. A two variable Boolean function can have 4 possible combinations of variables, i.e. in SOP form, $\bar{A}\bar{B},\bar{A} B,A \bar{B},AB,$ with minterm designations m0, m1, m2, and m3. In POS form,$(A+B),(A+\bar{B}),(\bar{A}+B),(\bar{A}+\bar{B})$ with maxterm designations M0, M1, M2, M3.
What is a Multiplexer?
In digital electronics, a multiplexer, also called MUX or data selector, is a combinational logic circuit that accepts multiple data inputs and allows only one of them at a time to pass through the output line. The multiplexer has select lines to control which data input will pass through the output line. Depending upon the data input lines, there are several types of multiplexers such as 2:1 MUX, 4:1 MUX, 8:1 MUX, 16:1 MUX, and so on.
Introduction to 4:1 Multiplexer
The block diagram of a 4:1 multiplexer is shown in Figure-1.

The 4:1 multiplexer consists of 4 data input lines, i.e. I0, I1, I2, and I3, and two select lines, i.e. S0 and S1. The logic level applied to S0 and S1 determines which input data will pass through the output line.
The operation of the 4:1 multiplexer can be understood with the help of its truth table which is given below.
Select Lines | Output | |
---|---|---|
S1 | S0 | Y |
0 | 0 | I0 |
0 | 1 | I1 |
1 | 0 | I2 |
1 | 1 | I3 |
As we know, a two variable Boolean function has 4 possible combinations of input variables. Therefore, we can realize any two variable Boolean function using a 4:1 multiplexer.
Now, let us discuss the implementation of a two variable Boolean function using 4:1 MUX along with solved examples.
Implementation of a Two-Variable Function using a 4:1 Multiplexer
The implementation of a two variable Boolean function using a 4:1 multiplexer involves the following steps
- Step 1 − Draw the truth table for the given two variable Boolean function.
- Step 2 − The two input variables A and B are applied to the select lines S1 and S0 respectively.
- Step 3 − Connect logic 1 to those data input lines where the function is 1 in the truth table.
- Step 4 − Connect logic 0 to all the remaining data input lines.
Now, let us understand the realization of a two variable Boolean function using a 4:1 multiplexer with the help of an example.
Example 1
Use a 4:1 multiplexer to implement the following two variable logic function.
$$\mathrm{F(A \: + \: B) \: = \: \sum m(0, 1, 3)}$$
Solution
The truth table of the 4:1 multiplexer for the given logic function is as follows
Select Lines | Output | |
---|---|---|
S1 = A | S0 = B | Y |
0 | 0 | 1 |
0 | 1 | 1 |
1 | 0 | 0 |
1 | 1 | 1 |
Using this truth table, we can draw the logic block diagram to realize the function F using a 4:1 MUX which is shown in Figure-2.

Explanation
Here, the inputs A and B are applied to the select lines S1, and S0 respectively. From the truth table, it is clear that the function F = 1, when AB = 00, 01, 11. Thus, we connect logic 1 to the data input lines I0, I1, and I3, and the logic 0 is connected to the data input line I2.
Example 2
Implement the following two variable logic function by using a 4:1 MUX.
$$\mathrm{F(A,B) \: = \: \sum m(1, 3)}$$
Solution
The truth table of the 4:1 multiplexer for the given logic function is as follows,
Select Lines | Output | |
---|---|---|
S1 = A | S0 = B | Y |
0 | 0 | 0 |
0 | 1 | 1 |
1 | 0 | 0 |
1 | 1 | 1 |
Using this truth table, we can draw the logic block diagram to realize the function F using a 4:1 MUX which is shown in Figure-3.

Explanation
Here, the inputs A and B are applied to the select lines S1, and S0 respectively. From the truth table, it is clear that the given Boolean function F = 1, when AB = 01, 11. Hence, we connect logic 1 to the data input lines I1 and I3, and the logic 0 is connected to the remaining data input lines, i.e. I0 and I2.
Conclusion
In this way, we can implement a given two variable logic function with the help of a 4:1 multiplexer. Try to solve the following tutorial problems on implementation of a two variable Boolean function by using a 4:1 multiplexer to understand the concept in more depth.
Solving Problems
Q. 1 − Use a 4:1 multiplexer to implement the following two variable Boolean function.
$$\mathrm{F(x,y) \: = \: \sum m(0, 1)}$$
Q. 2 − Implement the following two variable Boolean function using a 4:1 multiplexer.
$$\mathrm{F(A,B) \: = \: \sum m(1,2,3)}$$
Q. 3 − Implement the following Boolean function by using 4:1 MUX.
$$\mathrm{F(A,B) \: = \: \sum m(0)}$$