127 views

Uploaded by chris

Final Exam

- ene103_lec12
- EE3101 Lab Manual 2013 UMN
- Digital 2 Test Report
- 5 Sequential Circuit
- ECEM323 Laboratory Manual (Dante)
- 1_dl121
- תכנון מיקרו מעבדים- הרצאה 4
- Ic Iprs Baneasa
- Multiplexers
- Digital Electronics problems
- Discussion de 2C
- UMN EE 2301 Exam 1
- NPTEL __ Electrical Engineering - Microprocessor5
- Microprocessors-mcq
- 21425-9021-Digital Electronics Lab Manual
- Digital Electronics Interview Questions
- ITU - Digital Circuits Course Slide No. 06
- Reducing Power Consumption Using Clock Gating Technique in Flipflop
- Xilinx Tutorial
- Sequential in digital design

You are on page 1of 10

Name:______________________________

I.D.:____SOLUTIONS________________

Final Exam

May 15, 2013

Problem 1

_______________

(20 pts.)

Problem 2

_______________

(15 pts.)

Problem 3

_______________

(20 pts.)

Problem 4

_______________

(20 pts.)

Problem 5

_______________

(25 pts.)

Problem 6

_______________

(20 pts.)

Problem 7

______________

(20 pts.)

_______________

(140 pts.)

Total

**

Check that you have completed all parts of all problems. Do not spend all your time on

one problem, since time is limited.

**

Write solutions only on the front side of the exam sheets and only on the page associated

with the problem. Solutions given in other locations will not be graded.

***

Read and solve each problem carefully, since partial credit will be limited!

2

Problem 1

Answer the following statements with T(rue) or F(alse) only.

(Do not guess, as points may be deducted for incorrect answers).

(a) Questions on combinational logic:

___T__ Limiting the fanin to gates for realizing a combinational logic function will, in

general, increase the propagation delay of the circuit.

___T__ Number zero has two representations in 1s complement system.

___F__ Finite fraction in decimal system can be always converted into finite fraction in

binary system

___T__ If a combinational logic function is realized in a two-level NOR-NOR circuit, it

cannot have static-1 hazards.

___F__ If a combinational logic function is realized in a two-level NAND-NAND circuit,

it cannot have static-1 hazards.

___T__ Any Boolean function can be implemented using only XOR gates and OR gates.

___F__ A dual of a Boolean function f can be obtained by interchanging logical AND and

logical OR operations, replacing each variable with its complement, and interchanging

logical 1 and 0 constants.

(b) Questions on sequential logic:

___F__ Given a Mealy model circuit and a Moore model circuit that realize the same

sequential system, the Mealy model circuit will usually have more states than the Moore

model.

___T__ Given a Mealy model circuit and a Moore model circuit that realize the same

sequential system, both of which use positive edge triggered D flip flops, the

corresponding Mealy model and Moore model outputs occur before and after the positive

edge of the clock, respectively.

___T___For a shift register circuit to work properly, the propagation delay through the

flip-flops must be greater than the clock cycle.

___T__ One reason that ASM chart representation is useful is that large sequential

systems (with many inputs) have state transitions that depend only on a small subset of

the inputs.

___F__ Master-Slave flip flop design can handle the transparency timing problem.

___T__ Master-Slave flip flop design can handle the logic race timing problem.

___T__ Any sequential circuit can be implemented using only JK flip-flops and 2-to-1

multiplexers.

Grading: deduct 1.4 pts for no answer (blank); deduct 2 pts for the wrong answer.

3

Problem 2

(a) Draw a Karnaugh map for a completely specified function (of 4 variables) having the

following number of prime implicants:

f(A, B, C, D) has

- one prime implicant containing a single literal,

- one prime implicant containing two literals,

- one prime implicant containing three literals,

- and no other prime implicants.

(b) If this function f(A, B, C, D) is realized using minimum (two-level) NAND-NAND circuit,

does this implementation have:

- static-1 hazards?

- static-0 hazards?

(explain your answer)

SOLUTION

(a)

ab

cd

00

01

11

10

00

01

11

10

(b) Two-level NAND implementation cannot have static -0 hazards. Solution for f shown in (a)

has no static-1 hazards.

4

Problem 3

(a) Briefly (3-4 sentences) describe the difference between combinational devices: PLA, PAL,

and ROM, in terms of their implementation of Boolean functions. Which one, PLA or PAL, is

easier to program?

SOLUTION

All these devices have n inputs, m outputs, and they implement m Boolean functions of n

variables. ROM implements the truth table for these functions, whereas PAL and PLA

implement functions in SOP form. PLA implementation minimizes the total number of

product terms (for all m functions), whereas PALs minimize each function separately. So

PAL is easier to program than PLA.

(b) Show how to implement any Boolean function of 10 variables using four ROM modules (of

size 256 x 8 bits each) and a 4-to-1 multiplexer. (i.e., draw a block diagram showing how to

connect these modules, and clearly indicate/label the inputs/outputs for each module).

SOLUTION

Denote the function of 10 variables as F (x0, x1,x7, x8, x9). Then each ROM can

implement any Boolean function of 8 variables, say x0, x1,, x7. (these are address lines

for each ROM). The remaining inputs x8, x9 are forwarded to select inputs of a 4-to-1

multiplexer. The ROM outputs are forwarded to data inputs of the mux, effectively

implementing an expansion of a 10-variable function over variables x8, x9, according to

Shannons theorem. That is, the data inputs to the mux are:

I0 = F (x0,x7, 0, 0) I1=F (x0,x7, 0, 1) I2=F (x0,x7, 1, 0) I3= F (x0,x7, 1, 1)

Note that only a single output (of each ROM) is used in such an arrangement (wasteful).

A more economical implementation is to use 4 outputs of a single ROM module where each

output implements I0, I1, I2 and I3. (This solution requires a single ROM module and a

MUX)

5

Problem 4

Analyze the circuit implementing single input (x), single output (Z) sequential network, shown

below.

(a) Is this a Mealy or a Moore model circuit? Show the next-state equations and an output

equation for this circuit. (Ignore the asynchronous set and reset inputs to the FFs.)

(b) Assuming the initial state of the circuit is Q1 Q2 Q3 =000, construct a minimal state table for

a circuit that performs the same function as this circuit. Label your states A, B, C, etc. where A

is the initial state. (You do not have to find a circuit realizing your state table.)

Note: a minimal state table ~ state table with minimal number of states.

x

CLK

Q1

Q2

Q

CRQ

CRQ

Q3=Z

CRQ

SOLUTION

(a) This is Moore model.

The next-state equations (or the inputs to the FFs) are

Q1+ = D1 = X

Q2+ = D2 = XQ1

Q3+ = D3 = XQ2

The output equation is Z=Q3

(b) Only four states can be reached from the initial state 000. The next-state table is shown

below

Q1Q2Q3

A-000

B-100

C-010

D-101

X=0

000

010

000

010

X=1

100

100

101

100

Z

0

0

0

1

6

Problem 5

(a) Show the state diagram for a single-input, single-output Mealy sequence detector such that

Z=1 if and only if the input has been 1010 for the last 4 clock times. Overlapping patterns are

allowed.

(b) Show the state diagram for a single-input, single-output Mealy sequence detector such that

Z=1 if and only if the input has been 1010 for the last 4 clock times. Overlapping patterns are not

allowed.

(c) Implement the sequence detector in part (b) using D flip-flops and one-hot state assignment.

(implementation means showing flip-flop input equations and an output equation)

Example:

Input X

Out Z(a)

Out Z(b)

1101011101010100

0000100000101010

0000100000100010

SOLUTION

(a)

1

10

101

00

A

B

C

D

X=0

B,0

D,0

B,1

D,0

1

A,0

C,0

A,0

A,0

7

(b)

1

10

101

00 or 1010

A

B

C

D

X=0

B,0

D,0

D,1

D,0

1

A,0

C,0

A,0

A,0

(c) Using one-hot state assignment, we need four D flip-flops (one for each state). Label the

states A, B, C, and D, and we have the following flip-flop input equations and output equation

A+ = DA = AX +CX +DX

B+ = DB = AX

C+ = DC = BX

D+ = DD = BX +CX +DX

Z = CX

Grading: (a) 8 pts, (b) 8 pts (c) 9 pts

Note: answers with redundant states will be given full credit if the answers satisfy the problem

specifications.

8

Problem 6

(a) Show the state table or a state diagram for a Moore FSM with one input X and two outputs Y

and Z. The FSM counts the number of times X is 1 and divides this number by 4, presenting the

current remainder on the outputs Y and Z in binary. (Y is the most significant bit.)

Example: X = 0111101..

Y =? 0011000..

Z =? 0101001..

SOLUTION

X

State

A

B

C

D

0

A

B

C

D

1

B

C

D

A

YZ

00

01

10

11

Note: this is a modulo-4 counter where the outputs YZ~ two bits of a counter

(b) Implement the Moore FSM in part (a) using a counter shown below.

Use two least significant bits A1A0 as outputs YZ, and apply control inputs UP=X and

DOWN=0

Grading: (a) 10 pts, (b) 10 pts

Note: answers with redundant states will be given full credit if the answers satisfy the problem

specifications.

9

Problem 7

ASM chart for Add-Shift control of a binary multiplier (discussed in class) has inputs St, M, K,

and outputs Done, Load, Ad, Sh.

(a) Using this ASM chart (shown below) derive the next-state equations and output equations.

Use straight binary state assignment to encode states.

(b) Assuming this ASM chart is implemented using a 2-bit register and a ROM, what is min size

ROM needed?

(c) Can this ASM chart be implemented using a single 16R4 PAL module (with no extra logic)?

This sequential PAL (as discussed in class) has 8 external inputs, 4 input/output terminals and

four D flip-flops. Its AND array can implement up to 8 product terms, so that each next-state

equation can have up to 8 product terms. Briefly explain your answer (YES or NO).

SOLUTION

Inputs St, M, K; outputs Done, Load, Ad, Sh. This system has 3 inputs, 4 outputs and 4 states.

Label the state variables AB. Using straight binary assignment for states, the equations can be

obtained directly from the ASM chart:

(a) Output equations

Done = AB

Load = ABSt

Ad = ABM

Sh = ABM + AB

Next state equations

A+ = ABM + ABMK + ABK

B+ = ABSt + ABMK + ABK + ABK + ABMK = ABSt + ABM + AB

10

since the system has 3 inputs, 4 outputs, and 2 flip-flops,

the number of ROM inputs is 3+2=5 and the number of ROM outputs is 4+2=6. So the ROM

size is 32 X 6 bits.

(c) Yes, it can be implemented using a single 16R4 PAL module, because it has 3 inputs, 4

outputs and 2 state variables. Boolean equations for the outputs and next states require less than 8

product terms.

Grading: (a) 10 pts, (b) 5 pts (c) 5 pts

- ene103_lec12Uploaded byKishore Krishnan
- EE3101 Lab Manual 2013 UMNUploaded byNate Linx
- Digital 2 Test ReportUploaded byTeddy S. Apriana
- 5 Sequential CircuitUploaded byLuis Chachayma
- ECEM323 Laboratory Manual (Dante)Uploaded byDanilyn Padillo Lucio
- 1_dl121Uploaded bySuci Prafitri
- תכנון מיקרו מעבדים- הרצאה 4Uploaded byRon
- Ic Iprs BaneasaUploaded byplum_brandy
- MultiplexersUploaded bymiloš_lakićević
- Digital Electronics problemsUploaded bychintu333
- Discussion de 2CUploaded bythe v keyz
- UMN EE 2301 Exam 1Uploaded bychris
- NPTEL __ Electrical Engineering - Microprocessor5Uploaded byRupaShaw
- Microprocessors-mcqUploaded byAawez Akhter
- 21425-9021-Digital Electronics Lab ManualUploaded byAravind Balasundaram
- Digital Electronics Interview QuestionsUploaded byetasuresh
- ITU - Digital Circuits Course Slide No. 06Uploaded byHaydar Şahin
- Reducing Power Consumption Using Clock Gating Technique in FlipflopUploaded byvpsampath
- Xilinx TutorialUploaded byprof_kt
- Sequential in digital designUploaded byIbrahem Hussein
- Digital QsUploaded byDinesh Reddy
- Elec reviewerUploaded byMark Cain Morningstar
- Design of a Low-Power 1.65 GBPS Data Channel for HDMI TransmitterUploaded byAnonymous e4UpOQEP
- Flip FlopsUploaded bysureshthuppallam
- ecadlab.pdfUploaded bySubrahmanyam Vjs
- Chapter 6 StldUploaded bySarath Chandra S
- DSD&DICAUploaded byRakesh
- High Speed and Low Power ASIC Using Threshold LogicUploaded byIJARBEST
- CounterUploaded byÆshok IncreĐible King
- double edge latch.pdfUploaded byHaribabu Veludandi

- ME5286CourseNotes6-2017.pdfUploaded bychris
- ME5286CourseNotes3-2017.pdfUploaded bychris
- ME5286RoboticsToday -1-RobotArms2017.pdfUploaded bychris
- ME5286RoboticsToday-3-BostonDynamicsWalkingMachines2017.pdfUploaded bychris
- ME5286CourseNotes4-2017.pdfUploaded bychris
- ME5286CourseNotes4-2017.pdfUploaded bychris
- ME5286CourseNotes9-2017.pdfUploaded bychris
- ME5286RoboticsToday-4-MeasurementArms2017.pdfUploaded bychris
- ME5286CourseNotes10-2017Uploaded bychris
- Bomb Defusal ManualUploaded bycontactzumorio
- ME5286CourseNotes5-2017.pdfUploaded bychris
- ME5286CourseNotes8-2017.pdfUploaded bychris
- UMN EE 2301 Exam 1Uploaded bychris
- ME5286CourseNotes7-2017.pdfUploaded bychris

- 6823_TestingIEC61850_QY_20170907_WebUploaded bymrme44
- List of Israeli Companies Quoted on the Nasdaq - WikipediaUploaded bynikhilspareek
- Week 1Uploaded byNanie Dwazni
- Receivables TRAINingUploaded bySrinivas Girnala
- Best Practices for Java in Virtual Machines on VMwareESXUploaded byChennuri Chiranjeevi
- 321988241-ls100-service-manual (3).pdfUploaded bykarlineoliva
- Open Gapps LogUploaded bycesar
- utf-8__session2Uploaded byqgocong
- 4 a Qualitative Approach to DesignUploaded bySwetha Vanam
- Computer Application in Business with tally.pdfUploaded byRizwan Ahmed
- Revised Report on the Algorithmic Language (ALGOL 60) - Peter Naur (Editor)Uploaded byElias Sullivan
- BPC Transport WhitepaperUploaded byPrabhakar Mettu
- Software Architecture ATM ExampleUploaded byOswald_Alving
- Image Edge Detection Based on Cellular Neural Network and Particle Swarm OptimizationUploaded byivy_publisher
- UntitledUploaded byVlad Andersen
- Differences Between Various Technologies in SAPUploaded bynimi111
- Designation of the School Information Communication Technology (Ict) CoordinatorUploaded byJOHNBERGIN E. MACARAEG
- OBIEE 11gUploaded byMohamed Abrar
- Visualizing Online Social NetworksUploaded bysuga1990
- Best Practices App BuildingUploaded byim
- PrepareAD FAILUploaded byAnonymous J2FhA5db
- Operting System (OS)Uploaded byacorpuz_4
- Basic Decision Tree.pptxUploaded byFara Pratiwi
- VSICM6_LabManualUploaded bySrinivas Kumar
- Risks Due to Convergence of Physical Security SystemsUploaded byMuhammad Dawood Abu Anas
- List of Documents ISO 13485 ISO 14971Uploaded byRashid Ali
- DeadlockUploaded bygowsikh
- sms (1)Uploaded byFauzan Akbar
- NumericalUploaded byRachit Madan
- ProjectUploaded byabrolabrol