Homework Assignment for ECE2030A: Introduction to Computer Engineering - Fall 2008 - Prof., Assignments of Electrical and Electronics Engineering

A homework assignment for the course ece2030a: introduction to computer engineering at georgia tech, fall 2008. The assignment includes five parts: drawing a 5-bit by 4-bit unsigned integer multiplier using and gates and full adders, drawing the output for five circuits given waveforms, designing a sequence detector using finite-state machine method, designing a 4-bit gray counter using finite-state machine method, and designing a finite-state machine for a whack-a-mole game. The assignment is due in class on november 7, 2008, and late turn-in is not accepted.

Typology: Assignments

Pre 2010

Uploaded on 08/04/2009

koofers-user-k3o
koofers-user-k3o 🇺🇸

8 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE2030A Fall 2008 Prof. H.-H. S. Lee
Georgia Tech Page 1 of 3
ECE2030A Introduction to Computer Engineering
Fall 2008
Homework Assignment #3
Assigned 10/29/08 Due in the first 5 min in class 11/07
No late turn-in accepted
1. (10%) Draw a 5-bit by 4-bit unsigned integer multiplier using AND gates and Full Adders, i.e.,
the multiplicand (top) is 5 bit while the multiplier (bottom) is 4 bit. (You don’t need to draw the
internal details of the Full Adder.)
2. (20%) Given the following wave forms (timing diagram), draw the output Z for each of the
five circuits below. Assume the initial values are zero. (Hint for (e): similar case to our
synchronous counter using Toggle cell. For transition, consider there is slight delay for the
arrival of the input to the second D flip-flop.)
En
D Q
Latch
C
D Q
Flip Flop
C
D Q
Flip Flop
C
D Q
Flip Flop
C
D Q
Flip Flop
Z Z
Z
Z X X X
X
Y
Y Y Y
(a) (b) (c)
(d)
C
D Q
Flip Flop
C
D Q
Flip Flop
Z X
Y
(e)
Y
X
pf3

Partial preview of the text

Download Homework Assignment for ECE2030A: Introduction to Computer Engineering - Fall 2008 - Prof. and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

Georgia Tech Page 1 of 3

ECE2030A Introduction to Computer Engineering

Fall 2008

Homework Assignment

Assigned 10/29/08 Due in the first 5 min in class 11/

No late turn-in accepted

  1. (10%) Draw a 5-bit by 4-bit unsigned integer multiplier using AND gates and Full Adders, i.e., the multiplicand (top) is 5 bit while the multiplier (bottom) is 4 bit. (You don’t need to draw the internal details of the Full Adder.)
  2. (20%) Given the following wave forms (timing diagram), draw the output Z for each of the five circuits below. Assume the initial values are zero. (Hint for (e): similar case to our synchronous counter using Toggle cell. For transition, consider there is slight delay for the arrival of the input to the second D flip-flop.)

En

D Q

Latch

C

D Q

Flip Flop

C

D Q

Flip Flop

C

D Q

Flip Flop

C

D Q

Flip Flop

Z Z

Z

X X X Z

X

Y

Y Y Y

(a) (b) (c)

(d)

C

D Q

Flip Flop

C

D Q

Flip Flop

X Z

Y

(e)

Y

X

Georgia Tech Page 2 of 3

  1. (20%) Using finite-state machine (FSM) method, design a sequence detector which will output 1 when the following input strings are encountered: 001 and 110. In other words, your design has to fulfill the following conditions: (Note that, you must implement this in one single circuit.)

0, Otherwise

1 ,ifInput(t-2,t) 110

1,ifInput(t-2,t) 001

Output(t)

  1. (20%) Using finite-state machine method to design a 4-bit Gray Counter. The Gray Counter counts numbers using Gray Code in which two successive numbers will have their Hamming distance to be one. The counting sequence is shown below. Design your sequential circuits, so that the count advances (and wraps around) upon each positive clock edge. Assume your D flip- flops do not have a clear bit input, so design the “clear” function as part of your implementation so that you can reset the counter back to 0000. (You can use D Flip-flop symbol directly without drawing its internal detail circuits.)

Gray Counter Sequence 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 1 0 0 1 1 1 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 0 0 1 1 0 0 0