skip to content

Digital Electronics

Introduction to Digitial Electronics
WHAT IS DIGITAL SIGNAL
DIGITAL ELECTRONICS
DIGITAL SIGNAL OVER ANALOG
ADVANTAGES OF DIGITAL SIGNAL
BINARY SYSTEM
BINARY NUMBER
BIT
BYTE
NUMBER SYSTEM
DECIMAL NUMBERS
BINARY NUMBERS
DECIMAL TO BINARY CONVERSION
BINARY TO DECIMAL CONVERSION
HEXADECIMAL TO DECIMAL
OCTAL TO DECIMAL
BINARY ARITHMETIC OPERATIONS
BINARY ADDITION
BINARY SUBTRACTION
BINARY MULTIPLICATION
BINARY DIVISION
BINARY COMPLIMENTS
1’S COMPLIMENT
2’S COMPLIMENT
ADDITION USING 1’S COMPLIMENT
SUBTRACTION USING 1’S COMPLIMENT
9’s compliments
10’s compliment
R’S COMPLIMENTS
(R-1)’S COMPLIMENTS
BOOLEAN ALGEBRA
INTRODUCTION
BOOLEAN ALGEBRA OPERATIONS
BOOLEAN ALGEBRA TERMINOLOGIES
LAWS OF BOOLEAN ALGEBRA
DE MORGAN’S THEOREM
DE MORGAN’S FIRST LAW
DE MORGAN’S FIRST LAW
MINIMISATION TECHNIQUE
TRUTH TABLE
CANONICAL MINTERM
CANONICAL MAXTERM
SOLVED EXAMPLE
KARNAUGH MAP
2 VARIABLE K-MAP
3 VARIABLE K-MAP
4 VARIABLE K-MAP
5 VARIABLE K-MAP
LOGIC GATES
INTRODUCTION
AND GATE
OR GATE
NOT GATE
NAND GATE
NOR GATE
XOR GATE
X-NOR GATE
DIGITAL LOGIC FAMILY
INTRODUCTION
DIODE TRANSISTOR LOGIC
RESISTOR TRANSISTOR LOGIC
3 INPUT RTL NOR GATE
TRANSISTOR TRANSISTOR LOGIC
CHARACTERSTICS OF DIGITAL LOGIC FAMILY
FAN IN FAN OUT
POWER DISSIPATION
FIGURE OF MERIT
EMITTER COUPLED LOGIC
ARITHMATIC OPERATIONS
HALF ADDER
FULL ADDER
HALF SUBTRACTOR
FULL SUBTRACTOR
PARALLEL BINARY SUBTRACTOR
DERIVING FULL SUBTRACTOR
DIFFERENT BINARY CODES
INTRODUCTION
WEIGHTED BINARY SYSTEMS
8421 CODE OR BCD CODE
2421 CODE
5211 CODE
REFLECTIVE CODE
SEQUENTIAL CODE
EXCESS 3 CODE
EXCESS 3 CODE EXAMPLE
GRAY CODE
MORSE CODE CHART
COMBINATIONAL CIRCUITS
MULTIPLEXER
4 TO 1 MULTIPLEXER
APPLICATIONS OF MULTIPLEXER
DEMULTIPLEXER
1 TO 4 DEMUX
APPLICATIONS OF DEMUX
ENCODERS
INTRODUCTION
PRIORITY ENCODER
8 TO 3 PRIORITY ENCODER
4 TO 2 PRIORITY ENCODER
DECODERS
INTRODUCTION
BASIC BINARY DECODER
CASCADING DECODERS
APPLICATION OF DECODER
PARITY GENERATORS
PARITY BIT
PARITY GENERATOR
EVEN PARITY GENERATOR
ODD PARITY GENERATOR
EVEN PARITY CHECKER
ODD PARITY CHECKER
FLIP FLOP
INTRODUCTION
S-R FLIP FLOP
D FLIP FLOP
J-K FLIP FLOP
T FLIP FLOP
SHIFT REGISTERS
INTRODUCTION
SERIAL IN SERIAL OUT SHIFT REGISTER
SERIAL IN PARALLEL OUT
PARALLEL IN PARALLEL OUT
BIDIRECTIONAL SHIFT REGISTER
COUNTERS IN SHIFT REGISTER
COUNTERS
COUNTERS
SYNCHRONOUS COUNTERS
4 BIT SYNCHRONOUS UP COUNTERS
4 BIT SYNCHRONOUS UP COUNTER OPERATION
4 BIT SYNCHRONOUS DOWN COUNTER
APPLICATION OF SYNCHRONOUS COUNTERS
1 of 2
Previous Topic
Next Topic

AND GATE

AND GATE

An AND gate is a logic gate having two or more inputs and a single output. An AND gate operates on logical multiplication rules. In this gate, if either of the inputs is low (0), then the output is also low. If all of the inputs are high (1), then the output will also be high. An AND gate can have any number of inputs, although 2 input and 3 input AND gates are the most common.

In multiplying 0 with 0 we will get 0, 1 with 0 or 0 with 1 we will get 0. Only we get 1 when 1 is multiplied by 1.

In other words, an AND gate is a digital device that produces high output only when all inputs are high and produces low output under all other inputs conditions. A high digital signal means logically 1 and a low digital signal means logically 0.

An AND gate may have any number of input probes but only one output probe.