Written exam with solutions IE1204/5 Digital Design Friday 13/

Similar documents
Written reexam with solutions for IE1204/5 Digital Design Monday 14/

Written exam with solutions IE Digital Design Friday 21/

Written exam for IE1204/5 Digital Design with solutions Thursday 29/

Written exam with solutions IE1204/5 Digital Design Monday 23/

Philadelphia University Student Name: Student Number:

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #2 Nov 22, 2006

The Design Procedure. Output Equation Determination - Derive output equations from the state table

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

WORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of

ECE 2300 Digital Logic & Computer Organization

Synchronous Sequential Circuit Design. Digital Computer Design

Philadelphia University Student Name: Student Number:

BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO

Fundamentals of Digital Design

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering


Computers also need devices capable of Storing data and information Performing mathematical operations on such data

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value

CPE100: Digital Logic Design I

CPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic

University of Minnesota Department of Electrical and Computer Engineering

Digital Logic Appendix A

Sample Test Paper - I

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

ELEN Electronique numérique

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

7 Multipliers and their VHDL representation

ECE 448 Lecture 6. Finite State Machines. State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code. George Mason University

Lecture 10: Synchronous Sequential Circuits Design

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?

ELCT201: DIGITAL LOGIC DESIGN

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

Exam for Physics 4051, October 31, 2008

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017

11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

CHAPTER 7. Exercises 17/ / /2 2 0

MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI

Boolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra

Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker

FSM model for sequential circuits

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Fundamentals of Boolean Algebra

04. What is the Mod number of the counter circuit shown below? Assume initially reset.

Synchronous Sequential Circuit

Different encodings generate different circuits

MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI

Logic Design II (17.342) Spring Lecture Outline

Cs302 Quiz for MID TERM Exam Solved

DE58/DC58 LOGIC DESIGN DEC 2014

Design of Sequential Circuits

Chapter 7 Logic Circuits

COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

Digital Control of Electric Drives

Show that the dual of the exclusive-or is equal to its compliment. 7

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Chapter 6. Synchronous Sequential Circuits

DIGITAL LOGIC CIRCUITS

University of Toronto Faculty of Applied Science and Engineering Final Examination

EECS 270 Midterm 2 Exam Answer Key Winter 2017

Practice Final Exam Solutions

ECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview

Synchronous Sequential Logic

ENEL Digital Circuit Design. Final Examination

Digital Electronics Final Examination. Part A

Lecture A: Logic Design and Gates

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

University of Guelph School of Engineering ENG 2410 Digital Design Fall There are 7 questions, answer all questions.

Save from: cs. Logic design 1 st Class أستاذ المادة: د. عماد

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

CSC9R6 Computer Design. Practical Digital Logic

The University of Michigan Department of Electrical Engineering and Computer Science. EECS 270 Fall Practice Final Exam.

Appendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs

ELCT201: DIGITAL LOGIC DESIGN

CMPE12 - Notes chapter 1. Digital Logic. (Textbook Chapter 3)

EGR224 F 18 Assignment #4

Assignment # 3 - CSI 2111(Solutions)

Adders, subtractors comparators, multipliers and other ALU elements

ENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic

Simplifying Logic Circuits with Karnaugh Maps

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

CHW 261: Logic Design

Lecture 2 Review on Digital Logic (Part 1)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences

EE 209 Spiral 1 Exam Solutions Name:

Digital Circuits ECS 371

EECS150 - Digital Design Lecture 16 Counters. Announcements

Digital Electronics Circuits 2017

Faculty of Engineering. FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY

Dept. of ECE, CIT, Gubbi Page 1

Adders, subtractors comparators, multipliers and other ALU elements

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

CPE100: Digital Logic Design I

Preparation of Examination Questions and Exercises: Solutions

CARLETON UNIVERSITY Final EXAMINATION April 16, 2003

10/12/2016. An FSM with No Inputs Moves from State to State. ECE 120: Introduction to Computing. Eventually, the States Form a Loop

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS

Transcription:

Written eam with solutions IE204/5 Digital Design Friday / 207 08.00-2.00 General Information Eaminer: Ingo Sander. Teacher: Kista, William Sandqvist tel 08-7904487 Teacher: Valhallavägen, Ahmed Hemani 08-7904469 Eam tet does not have to be returned when you hand in your writing. Aids: No aids are allowed! The eam consists of three parts with a total of 4 tasks, and a total of 0 points: Part A (Analysis) containes ten short questions. Right answer will give you one point. Incorrect answer will give you zero points. The total number of points in Part A is 0 points. To pass the Part A requires at least 6p, if fewer points we will not look at the rest of your eam. Part A2 (Methods) contains two method problems on a total of 0 points. To pass the eam requires at least points from A A2, if fewer points we will not look at the rest of your eam. Part B (Design problems) contains two design problems of a total of 0 points. Part B is corrected only if there are at least p from the eam A- Part. NOTE! At the end of the eam tet there is a submission sheet for Part A, which shall be separated and be submitted together with the solutions for A2 and B. For a passing grade (E ) requires at least points on the eam. If eactly 0p from A(6p)A2(4p), (FX), completion to (E) will be offered. Grades are given as follows: 0 6 9 22 25 F E D C B A The result is epected to be announced before Friday /2 207.

Part A: Analysis Only answers are needed in Part A. Write the answers on the submission sheet for Part A, which can be found at the end of the eam tet.. p/0p A function f(, y, z) is described om minimized SoP form (Sum of products): f (, y, z) { SoP} min y z Write down the function as a minimized product of sums. f (, y, z ) PoS min { }?. Proposed solution. f (, y, z) { SoP} y z min f (, y, z) { PoS} min ( y) ( y z) 2. p/0p Useless circuit (!). A 5-bit adder is connected to multiply a binary unsigned 4-bit number 2 0 with a constant k, y k. Let the number be 00 2 what will the (6 bit) sum y y 5 y 4 y y 2 y y 0 be? 2. Proposed solution. If ignoring Carry out (5 bit sum) the circuit performs the operation y (2 ) the number remains unaffected by adder ( k ). 00 000. With Carry out (the 6 bit sum) 00 000. Yes this circuit is realy useless outside the eam (where it is worth p).. p/0p A two s complement 6-bit number is 6 FFFB (headecimal). This number will be transfered to a 4-bit register (the number of bits will be reduced and the sign kept). Epress this 4-bit number as a decimal number with sign ± 0?. Proposed solution. The twelve ecess sign bits are ignored B 0 - (000) -00 2-5 0 2

4. p/0p Given is a Karnaugh map for a function of four variables Y f(, 2,, 0 ). Write the function Y min, as a minimized sum of products, on SoP form. - in the map means don t care. 4. Proposed solution. 0 0 0 0 2 min ),, ( ),,, ( f f Y 5. p/0p The figure below shows a circuit with two NOR gates and two NAND gates. Simplify the function Y f( a, b, c, d ) as much as possible and write the function on SoP-form. 5. Proposed solution. { } d ab abc d c b a dm d c b a Y ) ( ) (

6. p/0p Give an epression for the logical function realized by the CMOS circuit in the figure. Write the function on SoP-form. F f(a, B, C, D)? 6. Proposed solution. Pulldown net F B A ( C D) F B A ( C D) B A ( C D) B ( A ( C D)) B ( A C D) B A B C D 7. p/0p A State Machine can be drawn either as state diagram or as ASM chart (Algorithmic State Machine chart). This figure shows an ASM-chart. Draw the equivalent Moore state diagram using the circles in the right figure. The same figure is also on the submission sheet. 7. Proposed solution. 4

8. p/0p A synchronous counter starts in the state q 2 q q 0 000. What will the state be after four clock pulses? q 2 q q 0? 8. Proposed solution. The counter is a Moebius counter that counts the Creeping Code. q q q : 000 00 0 0 q q q 0 2 0 2 0 9. p/0p The figure shows a latch circuit. Complete the timing diagram. The same timing diagram is also on the submission sheet. 9. Proposed solution. 5

0. p/0p At the labs, we use chips from the 74-series. They are nowadays used as spares. These functions can instead be described using VHDL code and downloaded to programmable logic. The circuit 742 is shown to the right. Below are the VHDL code for the circuit. In the code, we have hidden the line o from you ( with characters ). Write VHDL code for the line o2 < ( ) ; library ieee; use ieee.std_logic_64.all; entity A74XX2 is port ( a : in std_logic; b : in std_logic; c : in std_logic; d : in std_logic; a2 : in std_logic; b2 : in std_logic; c2 : in std_logic; d2 : in std_logic; o : out std_logic; o2 : out std_logic ); end entity; architecture dataflow of A74XX2 is begin o < ( ) ; o2 < ( ) ; end architecture; 0. Proposed solution. o2 < ( a2 and b2 and c2 and d2 ) ; 6

Part A2: Methods Note! Part A2 will only be corrected if you have passed part A ( 6p). 4p ANDON signal lights. In production factories with assembly line a system of warning lights green (G), yellow (Y) and Red (R) are used at the assembly stations. Operators have a stop button (with a cord) that stops the assembly line and all stations then signals red. The operator also has an alert button to summon help. It will signal yellow light at the own station and for all previous stations along the assembly line, but without stopping it. When all problems are removed, the assembly line may be started again with a short start pulse (Start). All stations then signals the green light. See the figure that shows three stations with the operator buttons and lights. The arrow indicates the transport direction of the assembly line. a) (abp) (Green) A short pulse Start can start the assembly line if Ready. Design a circuit that provides signal Ready if none of the stop signals s s 2 s are. b) (Red) The assembly line is stopped if Reset. Design a circuit that provides signal Reset if any of the signals s s 2 s is. Reset f(s,s 2,s ). Draw the two circuits together, use a few optional gates. c) (2p) (Yellow) Operators can warn on problems by lighting a yellow lamp. The signals w w 2 w shall lit their own yellow light (y at w or y 2 at w 2 or y at w ), but also lit the yellow lights belonging to the stations that are earlier in the direction of assembly line (stations after shall not be warned). Set up the truth table for y y 2 y f(w,w 2,w ). Derive the functions y f(w,w 2,w ) y 2 f(w,w 2,w ) y f(w,w 2,w ) by inspecting the truth table or by using Karnaugh map. Design the circuit with a few optional gates. 7

d) (p) It is common with more than three workstations along a conveyor belt. In the figure, a warning signal w IN from an subsequent group of stations, and a warning signal w OUT to a previous group of stations, has been added. Completed the circuit from c) with the signals signal w OUT and w IN in such a way that it works together with the other stations. (Rule: all previous stations must also warn with yellow light).. Proposed solution. a) Ready s s 2 s s s 2 s { dm} s s2 s b) Reset s s2 s c) y w ( inspection of t-table) y w w2 w (inspection) y w (K-map) 2 2 w d) w IN is or-ed together with w. y w w ) ( I 2 w2 ( w wi ) w w2 ( w win y y ) w OUT will now be the same as y. w y w w w w ) OUT 2 ( I 8

2. 6p Counter A modulo-6 synchronous counter consists of three D-flip-flops and one XOR-gate and one AND-gate, se the figure. a) (p) Derive the epressions for net state q q? q?? 2 b) (p) Set up the complete state table q q2 q f ( qq2q) c) (p) Draw the complete state diagram. d) (p) Which states are not part of the modulo-6 sequence? What will happen if one starts from any of these states? Redesign the circuit, maintaining the function so that it uses two 2: multipleers in place of the gates. See figure to the right. e) (2p) What signals should be connected to the multipleer data inputs to replace the gates? q q : mu 0 : mu 0?,?, mu? mu? 2. Proposed solution. 9

0

Part B. Design Problems Note! Part B will only be corrected if you have passed part AA2 ( p).. 5p Synchronous sequential circuit. Detector for specific event. A shift register is used to detect when a particular sequence occurs in a sequence of bits to input w. The signal w is synchronized with the clock pulses c. Each time the correct bit sequence appears z. At start is w 0. a) (p) Which bit sequence is detected? One can construct a Moore machine with fewer D-flip-flops that detects the same sequence. b) (p) Draw the State Diagram for such a sequence detector. c) (2p) Derive the state table and the coded state table, using binary code as state code. Derive minimized epressions for net state decoder and output decoder. You do not need to draw any circuit diagram. d) (p) Minimize the following state diagram. Then draw the minimized state diagram. Note that this is a completely independent task without any connection to the former sequence detector.. Proposed solution. a) The input sequence will be 0 0. b)

c) z q 2 q 2 qq0 w d) Independent task. q0 q q w q q w qq0w 0 0 4. 5p Registration of double edges. Pulses are received at two inputs a and b of an asynchronous sequential circuit. As soon as a total of two positive edges (transitions from 0 ) has been submitted to the inputs then the output y becomes (and then remains regardless of input signals). Two edges means that it either enters two pulses to any of the inputs, or enters one pulse to each input. The pulses may come at any time to the inputs and no assumption can be made about the length of the pulses. At start both input signals are a b 0. No simultaneous input signal changes can occur. a) (2p) Study the possible inputs, and set up a proper flow table for the sequential circuit. Draw the state diagram.. b) (2p) Make a suitable state assignment with an eitation table that provides circuits that are free from critical race (comment on how you achieved this). You will also develop the hazard free epressions for the net state (comment on how you achieved this) as well as an epression for output. c) (0,5p) Draw the circuit diagram. (Use optional gates). d) (0,5p) To be useful, the sequential circuit will need a Reset input so that it can be re-started. Complete the circuit with such a function. (Use optional gates). 2

4. Proposed solution. a) b) B and D are on Hammingdistance 2. For B ab, unstable state C will forward B to D. c) d) An active low Reset could be inserted with two and-gates as the initial state A has the code 00.

Good Luck! 4

Submission sheet for Part A Sheet ( remove and hand in together with your answers for part A2 and part B ) Last name: Given name: Personal code: Sheet: Write down your answers for the questions from Part A ( to 0 ) Question Answer { }? f (, y, z ) PoS min 2 4 5 6 00 2 y k y 5 y 4 y y 2 y y 0? 6 FFFB 4-bit ± 0? Y {SoP} min Y f( a, b, c, d ) F f(a, B, C, D) 7 8 q 2 q q 0 000?? 9 0 o2 < ( ) ; This table is completed by the eaminer!! Part A (0) Part A2 (0) Part B (0) Total (0) Points 2 4 Sum Grade 5

6