Logic Networks/Seven Segment Displays

  • Thread starter Thread starter Fr33t
  • Start date Start date
  • Tags Tags
    Logic
AI Thread Summary
The discussion revolves around designing a logic network to display the characters "APPLE" on a seven-segment display using a 2-bit input encoding. Users are confused about how to implement the logic with only 2 bits instead of 4, despite understanding that only 4 characters need to be displayed. A truth table has been created to represent the segments for each character, and there is a suggestion to use Karnaugh Maps (K-maps) to minimize the output functions for the segments. The consensus is that the K-maps will help define the logic for each of the seven segments based on the 2-bit input. The conversation concludes with a user expressing confidence in their understanding after receiving clarification.
Fr33t
Messages
2
Reaction score
0

Homework Statement


Here's the problem:

Design a logic network that can display the characters in “APPLE” on a sevensegment
display unit. Write the truth table for the output functions C0-C6, minimize them
by using Karnaugh Map, and implement using discrete logic gates.
(Hints: Character “A” will be displayed if segments (C0, C1, C2, C4, C5, C6) of a 7-
segment display are turned on and segment (C3) is turned off. Since only 4 characters
will be displayed, input of 2 bits to encode them will be needed for the given design.)

Now, where I get confused is when it says an input of 2 bits to encode them will be needed. I understand that technically only 2 bits are needed, but I do not understand how to implement it using only 2 instead of 4. I've been searching and thinking of different ways to do it but I am stumped.

Homework Equations


Not quite applicable


The Attempt at a Solution


With 2 bits to work with:
00 = A
01 = P
10 = L
11 = E
Code:
A	B	C0	C1	C2	C3	C4	C5	C6
0	0	1	1	1	0	1	1	1
0	1	1	1	0	0	1	1	1
1	0	0	0	0	1	1	1	0
1	1	1	0	0	1	1	1	1
But what is the point of using a K Map for this? I am almost sure this is where I am wrong but I have no idea what to do?

Any help will be greatly appreciated! Thanks
 

Attachments

  • sevenseg.jpg
    sevenseg.jpg
    12.7 KB · Views: 516
Last edited by a moderator:
Physics news on Phys.org
Fr33t said:

Homework Statement


Here's the problem:

Design a logic network that can display the characters in “APPLE” on a sevensegment
display unit. Write the truth table for the output functions C0-C6, minimize them
by using Karnaugh Map, and implement using discrete logic gates.
(Hints: Character “A” will be displayed if segments (C0, C1, C2, C4, C5, C6) of a 7-
segment display are turned on and segment (C3) is turned off. Since only 4 characters
will be displayed, input of 2 bits to encode them will be needed for the given design.)

Now, where I get confused is when it says an input of 2 bits to encode them will be needed. I understand that technically only 2 bits are needed, but I do not understand how to implement it using only 2 instead of 4. I've been searching and thinking of different ways to do it but I am stumped.

Homework Equations


Not quite applicable


The Attempt at a Solution


With 2 bits to work with:
00 = A
01 = P
10 = L
11 = E
Code:
A	B	C0	C1	C2	C3	C4	C5	C6
0	0	1	1	1	0	1	1	1
0	1	1	1	0	0	1	1	1
1	0	0	0	0	1	1	1	0
1	1	1	0	0	1	1	1	1
But what is the point of using a K Map for this? I am almost sure this is where I am wrong but I have no idea what to do?

Any help will be greatly appreciated! Thanks

Welcome to the PF.

Everything you've done looks correct. Now just do the 7 K-maps (or just write the 7 equations) that define the logic that drives the 7-segment displays. The same logic is repeated at each display, and drives the 7 segments based on that 2-bit input AB.

BTW, I edited your post to insert Code tags around your table. This preserves the column alignment.
 
Thanks a million berkeman, I think I got it all figured out!
 

Similar threads

Replies
14
Views
5K
Replies
2
Views
4K
Replies
22
Views
5K
Replies
12
Views
2K
Replies
1
Views
2K
Replies
1
Views
2K
Back
Top