Scribd
Upload
9 views1 page

4-Segment Display Decoder Design

The document outlines a circuit design task involving a 4-segment display controlled by a 3-bit input (A, B, C). It includes instructions for determining the letters displayed for various input combinations, grouping in Karnaugh maps, and writing Boolean expressions for each segment. The task is divided into three parts, with specific marks allocated for each section.

Uploaded by

sarihammad
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
9 views1 page

4-Segment Display Decoder Design

The document outlines a circuit design task involving a 4-segment display controlled by a 3-bit input (A, B, C). It includes instructions for determining the letters displayed for various input combinations, grouping in Karnaugh maps, and writing Boolean expressions for each segment. The task is divided into three parts, with specific marks allocated for each section.

Uploaded by

sarihammad
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

Part C: Circuit Design (14 marks)

Consider the 4-segment display on the right. These segments are used to display 6
0
different letters of the alphabet, given a 3-bit input from A, B & C, according to the
block diagram below: 3 1
A Segment 0
4-Segment Segment 1
B
Decoder Segment 2 2
C Segment 3
The following Karnaugh Maps show the behaviour of this 4-segment decoder:

BC BC BC BC BC BC BC BC

Segment 0:
A 1 0 1 1 Segment 1:
A 1 1 1 0
A 0 0 X X A 0 1 X X

BC BC BC BC BC BC BC BC

Segment 2:
A 1 1 0 1 A 1 1 1 1
Segment 3:
A 1 0 X X A 1 0 X X

1. Assuming that the segments in this 4-segment display are active-high, what letters are displayed on the 4-
segment display, given the following values for inputs [A,B,C]? (6 marks)

[0,0,0]: ______________ [0,0,1]: ______________

[0,1,0]: ______________ [0,1,1]: ______________

[1,0,0]: ______________ [1,0,1]: ______________

2. Circle the optimal Karnaugh map groupings in the Karnaugh map diagrams above. (4 marks)

3. In the spaces below, write the Boolean expressions for the 4 segments, based on your Karnaugh map
groupings from Part 2. (4 marks)

Segment 0: _____________________________________

Segment 1: _____________________________________

Segment 2: _____________________________________

Segment 3: _____________________________________

Student Number: __________________ 7 (continued)

You might also like