2. CONTENT THAT BE COVERED:
• Decoder
• Example of binary decoder.
• Decoders: implementing function.
• Decoder with enable.
• Multiplexers
• Block diagram of multiplexer.
• Majority function using a Multiplexer.
• Types of lines in multiplexer.
• Three-state gates.
• Graphic symbol for a three-state Buffer.
4. DECODER
• A decoder is a combination logic circuit which has many input and
output lines.
• Therefore a decoder has “n” input lines and maximum “m” output
lines, where
• m=2n. When the decoder circuits is enable l, based on the
combination of
• input present, one of the 2n output lines will be active high.
• The decoder is also known as min-term generator or max-term
generator
7. DECODER : IMPLEMENTING
FUNCTION.
•Boolean function, in sum of min-terms form decoder
to generate the min-terms, and an OR gate to form
the sum.
•Any combinational circuit with n inputs and m outputs
can be implemented with an n:2n decoder with m OR
gates.
8.
9.
10. Decoders with Enable
A standard decoder typically has
an additional input called Enable.
Output is only generated when
the Enable input has value 1;
otherwise, all outputs are 0. Only
a small change in the
implementation is required: the
Enable input is fed into the AND
gates which produce the outputs.
12. MULTIPLEXERS
•Combinational circuit that select binary
information from one of many input lines and
directs it to output line.
•That also simplify Data Selector.
• Multiplexers has:
• N data inputs (Multiple)
• 1 Output (Single)
• M select inputs, with 2M = N
18. THREE-STATE GATES
• Multiplexer can be constructed with three-state gates. A three state
gates is a digital circuit that exhibits three state. Two of the states
are signal equivalent to logic 1&0 as a conventional gate. The third
state gates is a the high-impedance state that behaves like An open
circuit that means Output appears To disconnect and the circuit has
no logic significant.
• The most commonly used is the buffer gate.
