Combinational Circuits -2 Study Notes for GATE & Computer Science Engineering Exams

By Priya Upadhyay|Updated : September 16th, 2021

Designing Combinational Circuits: 

The steps to design combinational circuits are as the following:

  1. Understand the problem
  2. Find the required number of input and output variables
  3. Construct a truth table using the relationship between the input and output
  4. Obtain the Boolean function or the logical expression from the truth table using Karnaugh Map.
  5. Draw a logic circuit based on the obtained logical expression.

Arithmetic Circuits

Arithmetic circuits are usually used to perform addition and subtraction. Binary adder and binary subtractor performs binary addition and binary subtraction respectively .

Classification of Adder are - (i) Half Adder  (ii) Full Adder

Classification of Subtractor are - (i) Half Subtractor and (ii) Full Subtractor

Half Adder: This circuit is used for the addition of two one-bit numbers.

  • The truth table of Half Adder:

byjusexamprep

  • Half adder circuit:

byjusexamprep

Sum (S) = byjusexamprep

Carry (C) = AB

  • Implement of Half Adder Using NAND Gate:

byjusexamprep

Note: Required number of NAND Gates to implement Half Adder = 5

  • Implement of Half Adder Using NOR Gate:

byjusexamprep

Note: Required number of NOR Gates to implement Half Adder = 5

Full Adder

This is combinational logic circuit that performs the arithmetic sum of three input bits. It consists of three inputs and two outputs.

byjusexamprep

Truth table for Full Adder:

full1

Logic diagram of Full Adder:

  • Sum (S) = byjusexamprep
  • Carry (C0) = AB + BC + AC

byjusexamprep

  • A full adder = 2 Half adder + 1 OR Gate
  • Required minimum number of NAND gate to implement FA = 9
  • Required minimum number of NOR gate to implement FA = 9

Half Subtractor

It is a combinational logic circuit that subtracts two bit and produces their difference and borrow.

byjusexamprep

Logic Diagram- Half Subtractor:

  • Difference (D) byjusexamprep
  • Borrow (B0) = byjusexamprep
  • To implement half subtractor the total number of NAND/NOR are required = 5

byjusexamprep

Full Subtractor

It is a combinational logic circuit that performs subtraction involving three bit naming minuid bit, subtrahend bit and borrow from the previous stage

byjusexamprep

  • Difference (D) byjusexamprep
  • byjusexamprep
  • A full subtractor = 2 half subtractor + 1 OR gate
  • To implement full subtractor of NAND/NOR gates are required = 9

Multiplexer (MUX)

  • It is a combinational circuit that selects binary information from one of the many input lines and directs it to a single output line.
  • The selection of a particular input line is controlled by a set of selection lines.
  • MUX is also called: Many to one, Data selector, Universal circuit, or Parallel data serial.
  • Multiplexing means transmitting a large number of information units over a smaller number of channels or lines. It is abbreviated as MUX.
  • There are 2n input lines and n selection lines whose bit combinations determine which input is selected.

m = 2n implies n = log m where m = Number of data inputs, and n = Number of select lines.

byjusexamprep

2 × 1 MUX :

byjusexamprep

Universal equation byjusexamprep

Implementation of one MUX using another MUX:

byjusexamprep

byjusexamprep

Demultiplexer (DEMUX)

  • It is a circuit that receives information on a single line and transmits this information on one of 2n possible output lines.
  • The selection of a specific output line is controlled by the bit values of n selected lines.

byjusexamprep

1 × 2 Demux:

byjusexamprep

D0 = S′I

D1 = SI

  • Truth table of 1 × 2 Demux:

byjusexamprep

  • Circuit Diagram of 1 × 2 Demux:

Description: Image result for 1 × 2 Demux:

  • 1 × 4 Demux:
    • byjusexamprep
    • byjusexamprep
    • byjusexamprep
    • byjusexamprep

byjusexamprep

  • Truth table of 1 × 4 Demux:

byjusexamprep

  • Circuit Diagram of 1 × 4 Demux:

byjusexamprep

  • DEMUX Implementation using another DEMUX:

byjusexamprep

Decoders

  • A decoder is a combinational circuit that converts binary information from n input lines to a maximum 2n unique output lines.
  • If the n-bit decoded information has unused or don’t-care combinations, the decoder output will have fewer than 2n outputs.
  • The decoders presented here are n-to-m-line decoders, where m ≤ 2n. Their purpose is to generate the 2n (or fewer) minterms of n input variables.

byjusexamprep

2 × 4 Decoder:

  • byjusexamprep
  • byjusexamprep
  • byjusexamprep
  • byjusexamprep

byjusexamprep

Tutht table of 2 × 4 Decoder:

byjusexamprep

Encoders

  • It is a combinational circuit that converts information into coded form (binary).
  • It is a digital circuit that performs the inverse operation of a decoder.
  • An encoder has 2n (or fewer) input lines and n output lines.
  • The output lines generate the binary code corresponding to the input value.

Description: 24

You can follow the detailed champion study plan for GATE CS 2021 from the following link:

Detailed GATE CSE 2021 Champion Study Plan

Candidates can also practice 110+ Mock tests for exams like GATE, NIELIT ,ISRO with Test Series check the Subsequent link:

Click Here to Avail GATE CSE Test Series!(100+ Mock Tests)

Get unlimited access to 21+ structured Live Courses all 112+ mock tests with Online Classroom Program for GATE CS, ISRO, BARC & PSU Exams:

Click here to avail Online Classroom Program for Computer Science Engineering

Thanks

#DreamStriveSucceed

Download BYJU's Exam Prep for Preparation

Comments

write a comment

Follow us for latest updates