
- 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
AND Gate using 2:1 MUX in Digital Electronics
A multiplexer or MUX is a combinational circuit that accepts several data inputs and allows only one of them to flow through the output line. Multiplexer (MUX) is also known as data selector because it selects one from many.
A MUX consists of 2n data input lines, n select lines, and 1 output line. Since, it converts 2n input lines into 1 output line. Therefore, it is also called many-to-one device.
Depending upon the number of input lines, there are several types of multiplexer present such as 2:1 MUX, 4:1 MUX, 8:1 MUX, etc.
Since, this article is meant for explaining the implementation of an AND gate by using a 2:1 MUX. So, let us discuss a 2:1 MUX in detail.
What is 2:1 Multiplexer (MUX)?
The functional block diagram of a 2:1 MUX is shown in Figure-1.

A 2:1 MUX consists of 2 (21) data input lines designated by I0 and I1, 1 select line designated by S and 1 output line Y. The logic level either 0 or 1 applied to the select line S determines which input data will pass through the output line of the multiplexer.
Truth Table of 2:1 Multiplexer
The operation of the 2:1 MUX can be analyzed with the help of its truth table shown below.
Select Line (S) | Output (Y) |
---|---|
0 | I0 |
1 | I1 |
From this truth table, we can conclude that,
- If select line S is connected to logic level 0, the data input connected to I0 will pass through the output line Y.
- If select line S is connected to logic level 1, the data input connected to I1 will pass through the output line Y.
Now, let us discuss the basics of AND gate.
What is an AND Gate?
AND Gate is a basic logic gate which may have two or more inputs, but only one output. The AND gate gives logic 0 state (LOW) as output if any one of its inputs is in the logic 0 state, otherwise, it gives a logic 1 states (HIGH) as output. Therefore, the output of the AND gate is HIGH or logic 1 state, only if all its inputs are HIGH or logic 1 state. The logic symbol of a two input AND gate is shown in Figure-2.

The logic expression of the two input AND gate is given by,
$$\mathrm{Y\:=\:A\:\cdot \: B}$$
Where, the . (dot) symbol represents the AND operation. It is read as "Y is equal to A AND B".
The operation of the AND gate can be understood with the help of its function table which is given below.
Inputs | Output | |
---|---|---|
A | B | Y = A·B |
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
After getting insights on basics of AND gate and 2:1 MUX, we are able to realize an AND gate with the help a 2:1 MUX which is described in the following section.
AND Gate by using a 2:1 Multiplexer
The functional block diagram of a 2:1 multiplexer equivalent to the AND gate is shown in Figure-3.

Here, the input line I0 of the 2:1 MUX is set to logic 0 state. The input B of the AND gate is applied to the input line I1 of MUX. The input variable A of the AND gate is used to control select line of MUX.
The operation of the 2:1 MUX as the AND gate can be described as follows
- When A = 0, the output of the MUX as AND gate is 0.
- When A = 1, the output of the MUX as AND gate is equal to B.
The function table of the 2:1 MUX working as an AND gate is given as follows,
A (S) | B | Y | Description |
---|---|---|---|
0 | 0 | 0 |
Y = 0 When A = 0 |
1 | 0 | 0 | |
1 | 0 | 0 |
Y = B When A = 1 |
1 | 1 | 1 |
Hence, we can analyze it as follows,
$$\mathrm{Y\:=\:\bar{A}\:\cdot \: \bar{B} \: \cdot \: 0 \: + \: \bar{A} \: \cdot \: B \cdot 0 \: + \: A \: \cdot \bar{B} \cdot 0 \: + \: A \cdot B \cdot 1 \: = \: AB}$$
In this way, we can implement the AND gate by using a 2:1 multiplexer.