Scribd
Upload
48 views

Mini Assignment4 Solution

This document provides the steps to design a Gray code to binary coded decimal (BCD) converter. It includes: 1) The truth table that maps the 4-bit Gray code inputs to the 4-bit BCD outputs. 2) The use of Karnaugh maps to minimize the logic expressions for each BCD output - W, X, Y, and Z. 3) Implementation of the logic gates using Circuit Maker based on the minimized expressions.

Uploaded by

HARIKESH
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
48 views

Mini Assignment4 Solution

This document provides the steps to design a Gray code to binary coded decimal (BCD) converter. It includes: 1) The truth table that maps the 4-bit Gray code inputs to the 4-bit BCD outputs. 2) The use of Karnaugh maps to minimize the logic expressions for each BCD output - W, X, Y, and Z. 3) Implementation of the logic gates using Circuit Maker based on the minimized expressions.

Uploaded by

HARIKESH
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

DEPARTMENT OF MECHANICAL & AEROSPACE ENGINEERING

UNIVERSITY AT BUFFALO
MAE 476/576 Mechatronics
Spring 2003

Mini Assignment 4 – Solution

1. Design a Gray Code to BCD converter by the following procedures:


a. Write down the truth table of the converter.

Binary Coded Decimal (BCD) is a way to store the decimal numbers in binary form. The
number representation requires 4 bits to store every decimal digit (from 0 to 9). Since
there are 10 different combinations of BCD, we need at least a 4-bit Gray Code to create
sufficient number of these combinations.

The truth table is:

Gray Code BCD


Decimal
A B C D W X Y Z
0 0 0 0 0 0 0 0 0
1 0 0 0 1 0 0 0 1
2 0 0 1 1 0 0 1 0
3 0 0 1 0 0 0 1 1
4 0 1 1 0 0 1 0 0
5 0 1 1 1 0 1 0 1
6 0 1 0 1 0 1 1 0
7 0 1 0 0 0 1 1 1
8 1 1 0 0 1 0 0 0
9 1 1 0 1 1 0 0 1
10 1 1 1 1 D D D D
11 1 1 1 0 D D D D
12 1 0 1 0 D D D D
13 1 0 1 1 D D D D
14 1 0 0 1 D D D D
15 1 0 0 0 D D D D
b. Apply Karnaugh Map to look for the minimized logic expression.

Karnaugh Map for W:


A

00 01 11 10
00 0 0 1 D
01 0 0 1 D
D
11 0 0 D D
C
10 0 0 D D

Minimal Expression for W:


W=A

Karnaugh Map for X:

00 01 11 10
00 0 1 0 D
01 0 1 0 D
D
11 0 1 D D
C
10 0 1 D D

Minimal Expression for X:


X = A’B
Karnaugh Map for Y:

00 01 11 10
00 0 1 0 D
01 0 1 0 D
D
11 1 0 D D
C
10 1 0 D D

Y = A’BC’ + B’C

Karnaugh Map for Z:

00 01 11 10
00 0 1 0 D
01 1 0 1 D
D
11 0 1 D D
C
10 1 0 D D

Z = A’BC’D’ + B’C’D + AD + BCD + B’CD’


c. Implement the logic gates by using Circuit Maker.

You might also like