MID-TERM REVIEW

DIGITAL LOGIC DESIGN (CE118)

All the assignments students already did, and the problems in textbook about Data path.

Main content as follow:

Chapter 1:

- Analyze sequential Circuit.

- Synthesize (or Design) sequential circuit.
- Finite State Machine (Moore, Mealy)
- State minimization
- State encoding
- Cost, Delay of the circuit.

Chapter 2:

Part 1: Deign Registers, Memories

Part 2: Data path, Control path (or Control Unit)

- Algorithm (pseudo-code) for a particular task

- Data path is ready (as in Lecture slide), or a new custom Data path is designed
- Control word table for Data path

- FSM for Control Unit

- Next state table & equations of Control Unit
- Output table & equations of Control Unit
Some more exercises:
A Datapath and function tables of ALU and shifter are given as below:

ALU operation

Datapath

Shift Operation

1: Given a following pseudo code sequence:

1. sum = 1
2. n = input
3. while ( n ≠ 0) {
4. sum = sum * 2;
5. n = n – 1;
6. }
7. output = sum;

Assuming R0 has the value zero.

a. Make the table of control word for the algorithm above.

b. Draw State transition diagram of the Control Unit
 c. Create Next-state table and Next-state equation for the Control Unit (using D-flip flop).
d. Create Output table and Output equation for the Control Unit.

2: Given a following pseudo code sequence:

1. sum = 0
2. n = input
while (n > 2) {
3. sum = sum + 3;
4. n = n – 2;
}
5. output = sum;

Shifter câu 2

Assuming R0 has the value zero. Shifter in the Datapath is replaced by this picture.

a. Make the table of control word for the algorithm above.

b. Draw State transition diagram of the Control Unit
c. Create Next-state table and Next-state equation for the Control Unit (using D-flip flop).
d. Create Output table and Output equation for the Control Unit.

3. Design a recognizer that has an input x, an output Z, and an asynchronous Reset signal. The
recognizer sets the ouput Z to 1 if the input sequence has the form of {110}
ĐH Công Nghệ Thông Tin
ỹ Thuật Máy Tính 2014 – 2015
4. Minimize the states for the FSM given in Figure below, using State partitioning:

Mô hình của hệ tuần tự trên thuộc kiểu Moore hay Mealy? (0.5đ)
Kiểu Mealy
Rút gọn bảng trên bằng phương pháp phân hoạch trạng thái (1đ)
Rút gọn lần 1với S5 tương đương với S0
Rút gọn lần 2 với S4 tương đương với S1