Scribd
Upload
6 views2 pages

Digital Computer Fundamentals Unit3

The document covers combinational circuits, which are logic circuits where outputs depend solely on current inputs, with examples including adders, multiplexers, and comparators. It outlines the design procedure for these circuits, explains the functionality of half and full adders, and describes other components like multiplexers and encoders. Additionally, it discusses binary multiplication, comparators, and priority encoders.

Uploaded by

sanu63754
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

Digital Computer Fundamentals Unit3

The document covers combinational circuits, which are logic circuits where outputs depend solely on current inputs, with examples including adders, multiplexers, and comparators. It outlines the design procedure for these circuits, explains the functionality of half and full adders, and describes other components like multiplexers and encoders. Additionally, it discusses binary multiplication, comparators, and priority encoders.

Uploaded by

sanu63754
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Digital Computer Fundamentals

Unit 3: Combinational Circuits

3.1 Introduction
A combinational circuit is a logic circuit whose output depends only on the present inputs (no memory).
Examples include Adders, Subtractors, Multiplexers, Encoders, Decoders, Comparators.

3.2 Design Procedure


1. Derive the truth table from the problem.
2. Write the Boolean expression.
3. Simplify using Boolean algebra or K-map.
4. Draw the logic diagram.

3.3 Half Adder


• Adds two 1-bit numbers.
• Inputs: A, B
• Outputs: Sum = A ⊕ B, Carry = A·B
A B Sum Carry
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

3.4 Full Adder


• Adds three inputs: A, B, Carry-in (Cin).
• Outputs: Sum = A ⊕ B ⊕ Cin, Carry = AB + BCin + ACin
A B Cin Sum Carry
0 0 0 0 0
0 1 0 1 0
1 0 0 1 0
1 1 0 0 1
0 0 1 1 0
0 1 1 0 1
1 0 1 0 1
1 1 1 1 1

3.5 Parallel Adder/Subtractor


A 4-bit parallel adder is formed by connecting four full adders in series. For subtraction, the 2’s
complement method is used with XOR gates to invert B when subtracting.
3.6 Multiplication
Binary multiplication is equivalent to repeated addition. A 2-bit multiplier uses AND gates and adders.

3.7 Comparator
A comparator compares two binary numbers. Example: A 2-bit comparator produces outputs for (A > B),
(A = B), (A < B).

3.8 Multiplexer (MUX)


A multiplexer selects one input out of many. Example: 2:1 MUX → Y = A’·I0 + A·I1
Example: 4:1 MUX → Y = S1’S0’I0 + S1’S0I1 + S1S0’I2 + S1S0I3

3.9 Decoder
A decoder converts n inputs into 2■ outputs. Example: 2-to-4 decoder uses inputs A,B to produce outputs
D0–D3.

3.10 Encoder
An encoder converts 2■ inputs into n outputs. Example: A 4-to-2 encoder.

3.11 Priority Encoder


A priority encoder encodes the input with the highest priority when multiple inputs are active.

You might also like