Scribd
Upload
1K views9 pages

Logic Gates and Truth Tables Analysis

The document contains 5 problems related to combinational logic circuits. Problem 1 defines logic functions F1 and F2 in terms of inputs A, B, and C, and shows they are equivalent based on their truth table. Problem 2 designs a circuit to add two-bit numbers A and B. Problem 3 designs a circuit with 5 inputs that generates a 4-bit ones complement output. Problem 4 designs a BCD to 7-segment display decoder that only displays the number 8. Problem 5 derives the logic expression and diagram for a given circuit defined by the function F = BC + AC + AB + BCD.

Uploaded by

Steve Clar
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
1K views9 pages

Logic Gates and Truth Tables Analysis

The document contains 5 problems related to combinational logic circuits. Problem 1 defines logic functions F1 and F2 in terms of inputs A, B, and C, and shows they are equivalent based on their truth table. Problem 2 designs a circuit to add two-bit numbers A and B. Problem 3 designs a circuit with 5 inputs that generates a 4-bit ones complement output. Problem 4 designs a BCD to 7-segment display decoder that only displays the number 8. Problem 5 derives the logic expression and diagram for a given circuit defined by the function F = BC + AC + AB + BCD.

Uploaded by

Steve Clar
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

CLAR, STEVE E.

1. Express the following functions F1 and F2 in terms of the inputs A, B, and C. What is the
relationship between F1 and F2?

From the Logic Circuit Above, we can obtain the following functions F1 and F2.
̅̅̅̅ + 𝑨
𝑭𝟏 = (𝑨 + 𝑩𝑪)𝑩𝑪 ̅ 𝑩𝑪

̅̅̅̅ + 𝑨
𝑭𝟐 = 𝑨𝑩𝑪 ̅ 𝑩𝑪

TRUTH TABLE
A B C F1 F2
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 1 1
1 0 1 0 0
1 1 0 0 0
1 1 1 0 0

Based on the truth table, we can see that both output F1 and F2 are 1(True) only if input ABC (011) and
ABC (100). So meaning we can conclude that they are the same, they will turn on at the same time and
of at the same time.
CLAR, STEVE E.

2. Design a combinational circuit that accepts a two-bit unsigned number, A and B such that the output,
F = A plus B. Note that AB = 112 will never occur. Draw a schematic using logic gates. Show all steps
clearly.

Given the condition, we can add another output (carry) to avoid AB = 112 to occur. Consider the example
below.

Below are the truth table and logic circuit design for the combinational circuit, it is the same to a half
adder

TRUTH TABLE
A B F CARRY
A
0 0 0 0 CARRY
0 1 1 0 B
1 0 1 0
1 1 0 1

Code:
CLAR, STEVE E.

Wave
CLAR, STEVE E.

3. Design a combinational circuit with five input bits generating a 4-bit output that is the ones
complement of four of the five input bits. Draw a logic diagram. Do not use NOT, NAND, or NOR gates.

̅̅̅̅̅̅̅̅
𝑭 = 𝑨𝑩𝑪𝑫𝑬

B
C

A
OUTPUT

D
E
CLAR, STEVE E.

4. Design a combinational circuit for a BCD to seven-segment code converter that will input a BCD
number and output it on a seven segment common-anode display. The code converter will only
display the number 8. The converter will turn the display OFF for all other valid BCD digits except digit
9 which will never occur. Draw a schematic. Show all steps clearly.

Truth Table: BCD to seven-segment decoder


A B C D a b c d e f g
0 0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0
0 1 0 1 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0 0 0 0
1 0 0 0 1 1 1 1 1 1 1

Boolean Expression for the following based on the truth table:


̅̅̅̅̅̅̅
𝒂 = 𝑨𝑩𝑪𝑫 ̅̅̅̅̅̅̅
𝒅 = 𝑨𝑩𝑪𝑫 ̅̅̅̅̅̅̅
𝒈 = 𝑨𝑩𝑪𝑫
̅̅̅̅̅̅̅ ̅̅̅̅̅̅̅
𝒆 = 𝑨𝑩𝑪𝑫
𝒃 = 𝑨𝑩𝑪𝑫
̅̅̅̅̅̅̅
𝒄 = 𝑨𝑩𝑪𝑫 ̅̅̅̅̅̅̅
𝒇 = 𝑨𝑩𝑪𝑫

ABCD
CLAR, STEVE E.

ENCODER_PROC : process(digit)
begin
case digit is

when 0 => segments <= "0111111";


when 1 => segments <= "0000110";
when 2 => segments <= "1011011";
when 3 => segments <= "1001111";
when 4 => segments <= "1100110";
when 5 => segments <= "1101101";
when 6 => segments <= "1111101";
when 7 => segments <= "0000111";
when 8 => segments <= "1111111";
when 9 => segments <= "1101111";

end case;
end process;
CLAR, STEVE E.

5. Given the following circuit:


(a) Derive the Boolean expression for F(A, B, C, D).
(b) Derive the truth table.
(c) Determine the simplified expression for F(A, B, C, D) using a K-map.
(d) Draw the logic diagram for the simplified expression using NAND gates.

̅ + 𝑨𝑩 + 𝑩𝑪𝑫
𝑭 = 𝑩𝑪 + 𝑨𝑪

TRUTH TABLE
A B C D F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
CLAR, STEVE E.

A
F
B

̅ + 𝑩𝑪
𝑭 = 𝑨𝑪
̅ + 𝑪)
𝑭 = 𝑨𝑩(𝑪
𝑭 = 𝑨𝑩
CLAR, STEVE E.

You might also like