Digital Control of Electric Drives
|
|
- Cora Robinson
- 5 years ago
- Views:
Transcription
1 Digital Control of Electric Drives Logic Circuits - equential Description Form, Finite tate Machine (FM) Czech Technical University in Prague Faculty of Electrical Engineering Ver.. J. Zdenek 27
2 Logic equential Circuit Logic sequential circuit (LC) is described with state diagram, logic equations, transition and output tables, HDL language Input, output and inner (q i ) variables take only ar values Input tate I O Output tate x y q x n q k y m Inner tate At every time instant values of all output variables are defined by values of input variables at the same time instant and by values of inner variables (stored variables) (The LC has memory, i.e. the LC does remember its past states) BEM4DEP Digital Control of Electric Drives - 4 2
3 Finite tate Machine, Transition and Output Functions Logic sequential circuit abstract model Finite tate Machine (FM) or another name Finite tate Automaton (FA) Finite state machine finite number of input, output and inner states Let us define a given combination of input, inner and output variables as input, inner and output states I,, O i k j Transition function f: = f (, I t+ t t ) t t +,, I t inner next, inner and input current states Output function g: t O = g( t, I t ) t t O,, I t output, inner and input current states BEM4DEP Digital Control of Electric Drives - 4 3
4 Logic equential Circuit Generic Model (Huffmann) LC - Logic equential Circuit t O = g( t, I t ) I x,,x i Logic Combinational Circuit O y,,y j t+ t Memory = f (, I t (torage ) q,,q k Elements) BEM4DEP Digital Control of Electric Drives - 4 4
5 LC Categories Aspect input variables change time response Asynchronous LC state changes immediatelly after input variables change (or with small time delay due to inner LC circuits behaviour) ynchronous LC state change is synchronized with external synchronizing pulses (so-called clock ). The LC are designed mostly as synchronous better inner LC states tracking and supervision. Aspect calculation method of transition and output function LCC Mealy FM model Moore FM model Autonomous FM (e.g. counters, ) = f (, I t+ t t = f (, I t+ t t = f ( t+ t ) ) ) t O = g( O t = g( t O t = g( t t, I ) ) t ) BEM4DEP Digital Control of Electric Drives - 4 5
6 ynchronous FM Mealy Model = f (, I t+ t t ) t O = g( t, I t ) BEM4DEP Digital Control of Electric Drives - 4 6
7 ynchronous FM Moore Model = f (, I t+ t t ) O t = g( t ) BEM4DEP Digital Control of Electric Drives - 4 7
8 ynchronous FM Autonomous = f ( t+ t ) O t = g( t ) BEM4DEP Digital Control of Electric Drives - 4 8
9 Finite tate Machine (FM) Description Forms tate diagram directed graph form Equation system Transition and output tables HDL language (Hardware Description Language) A programming language pecification of all possible sequences of inputs and outputs - NO be not using - impractical input sequence may be of infinite length BEM4DEP Digital Control of Electric Drives - 4 9
10 FM Description Mealy Model Transition I / = / tate tate Diagram I / = / Input I / = / I / = / I / = / I / = / Output (located next to edge) Transition and Output Function Current state and input tate transition at time t to t+ Immediate output generation α I i α j k I α I α I α I 2 α 2 I 2 α 2 I α I : i α I j α : O k : O : O α I α I : O α I : O α I 2 : O α I 2 : O BEM4DEP Digital Control of Electric Drives - 4
11 FM Description Mealy Model tate Diagram Transition and Output Table Transition I / = / I / = / I / = / I / = / Transition Table i I I I / = / Output Table tate Input I / = / Output (located next to edge) i I I O O O O O O BEM4DEP Digital Control of Electric Drives - 4
12 FM Description Moore Model tate tate Diagram Input Output (located next to node) Transition and Output Function Current state and input tate transition at time t to t+ Immediate output generation α I i j k α I α I α I α I 2 2 α I 2 2 α I 3 3 α I 3 α I i : O k : O : O : O 3 : O α : BEM4DEP Digital Control of Electric Drives - 4 2
13 FM Description Moore Model tate Diagram Transition and Output Table Transition Table i I I 3 3 Output Table i O i tate Input Output (located next to node) O O O 3 O BEM4DEP Digital Control of Electric Drives - 4 3
14 Logic equential Circuit Design Process (schema) Design at gate level using schema: Requirement tatement verbal description tate diagram (directed graph of transitions and outputs) Transition and output tables Inner state and output coding Encoded transition and output tables Next-state and output logic function Minimization of next-state and output functions (K maps) Implementation at gate level schema (CAD tool, graphic editor) ynthesis from FPGA resources (CAD tool) Logic simulation (CAD tool) Timing simulation (post-route) (CAD Tool) Generating of FPGA configuration file (CAD tool) Calculation and verification of maximum clock frequency (next lecture) Verification in application (evaluation board) BEM4DEP Digital Control of Electric Drives - 4 4
15 Logic equential Circuit Design Process (HDL) Design at gate level using Hardware Description Language (VHDL, Verilog): Requirement tatement verbal description tate diagram (directed graph of transitions and outputs) Inscription in HDL (Hardware Description Language) (CAD tool) ynthesis from FPGA resources (HDL program compilation) (CAD tool) Logic simulation (CAD tool) Timing simulation (post-route) (CAD Tool) Generating of FPGA configuration file (CAD tool) Calculation and verification of maximum clock frequency (next lecture) Verification in application (evaluation board) BEM4DEP Digital Control of Electric Drives - 4 5
16 BEM4DEP Digital Control of Electric Drives Basic torage Element R- Latch R Q Q Q Q R!!! R Latch (NAND) i R i i Q i Q +!!! R Latch (NOR) i R i i Q i Q +!!! Prohibited tate
17 Clocked R- Latch Q R Clk Q R Latch (Clock enable) i R i Clk i Q + Q i X don t care X X!!! i Q!!! Prohibited tate BEM4DEP Digital Control of Electric Drives - 4 7
18 Clocked D Latch D Q ymbol Q Clk D Latch (Clock enable) i Clk i D Q + X i Q X don t care BEM4DEP Digital Control of Electric Drives - 4 8
19 D Flip-Flop ymbol Q Q D Clk D value storage controlled with rising edge of clock (Clk) D Flip-Flop Clk i D X X i Q + i Q i Q BEM4DEP Digital Control of Electric Drives - 4 9
20 D Flip-Flop (with asynchronous set-reset) ymbol Q Q D Clk R D value storage controlled with rising edge of clock (Clk) asynchronous set/reset D Flip-Flop Reset et i D X X X X Clk X X i Q + i Q i Q BEM4DEP Digital Control of Electric Drives - 4 2
21 2bit ynchronous Binary Counter Design synchronous finite state machine (FM) of counter type. Counter is two bit and it counts in binary code. Design FM with asynchronous reset. BEM4DEP Digital Control of Electric Drives - 4 2
22 2bit ynchronous Binary Counter What ought to be designed? BEM4DEP Digital Control of Electric Drives
23 2bit ynchronous Binary Counter tate Diagram I Inputs (autonomous FM no inputs) O Outputs i i-th state Transition Table i i+ 3 3 Output Table i O i O O O 2 3 O 3 BEM4DEP Digital Control of Electric Drives
24 2bit ynchronous Binary Counter Transition Table i i+ 3 3 tate Coding i i+ i q q d d i+ 3 3 BEM4DEP Digital Control of Electric Drives
25 2bit ynchronous Binary Counter Output Table i O I O O O 2 3 O 3 i Output Coding O i i q q y y O i O O O 2 3 O 3 i = O i BEM4DEP Digital Control of Electric Drives
26 2bit ynchronous Binary Counter Minimization d q 2 3 d = q q + q q = XOR q d q 2 3 d = q q y = q y = q BEM4DEP Digital Control of Electric Drives
27 2bit ynchronous Binary Counter Implementation BEM4DEP Digital Control of Electric Drives
28 2bit ynchronous Binary Counter What was designed? BEM4DEP Digital Control of Electric Drives
29 What was designed? 2bit ynchronous Binary Counter Next-state Function tate Register Output Function LCC LCC2 BEM4DEP Digital Control of Electric Drives
30 Detector of bit equence (FM Moore Model) Design synchronous finite state machine (FM) (Moore model) which detects sequence in input bit flow. FM will output impulse when each such sequence will be detected. Design FM with asynchronous reset. (Moore) BEM4DEP Digital Control of Electric Drives - 4 3
31 Detector of bit equence (FM Moore Model) What ought to be designed? BEM4DEP Digital Control of Electric Drives - 4 3
32 Detector of bit equence (FM Moore Model) tate Diagram I Inputs O Outputs i i-th state Transition Table i I I 3 3 Output Table i O i O O O 3 O BEM4DEP Digital Control of Electric Drives
33 Detector of bit equence (FM Moore Model) Transition Table i I I 3 3 tate Coding i q i I i+ q x d d i+ x Next-state Function tate Register q q clock d D Q q d D Q q 3 3 Feedback BEM4DEP Digital Control of Electric Drives
34 Detector of bit equence (FM Moore Model) Output Table i O I O O O 3 O Output Coding i y 3 BEM4DEP Digital Control of Electric Drives
35 BEM4DEP Digital Control of Electric Drives Detector of bit equence (FM Moore Model) d x q q d x q q x q q q q d + = y = q q x q q q q q q x x q q x q q x q q d ) ( + + = = + + = Minimization
36 Detector of bit equence (FM Moore Model) Implementation BEM4DEP Digital Control of Electric Drives
37 Detector of bit equence (FM Moore Model) What was designed? BEM4DEP Digital Control of Electric Drives
38 Detector of bit equence (FM Moore Model) What was designed? Next-state Function tate Register Output Function LCC LCC2 BEM4DEP Digital Control of Electric Drives
39 Detector of bit equence (FM Moore Model) int cbittream3decoder(int x_in, int reset){ // Moore type FA, // Inputs: x_in, reset, Outputs: y_out enum {s,s,s2,s3}; static int statereg=s, nexttate=s, y_out; if(reset == TRUE){ statereg = s; nexttate = s; x_in = ; } y_out = ; statereg = nexttate; switch(statereg){ case s: if(x_in == ); if(x_in == ) nexttate = s; break; case s: if(x_in == ) nexttate = s; if(x_in == ) nexttate = s2; break; case s2: if(x_in == ) nexttate = s3; if(x_in == ); break; case s3: y_out = ; if(x_in == ) nexttate = s; if(x_in == ) nexttate = s; break; default: // Error section y_out = ; nexttate = s; }// switch() END return(y_out); }// cbittream3decoder() END C BEM4DEP Digital Control of Electric Drives
40 Detector of bit equence (FM Moore Model) class JBittream3Decoder { final int s =, s =, s2 = 2, s3 = 3; int statereg = s, nexttate = s; int yout = ; public JBittream3Decoder() {// Constructor // empty } void setfsareset (boolean reset){ statereg = s; nexttate = s; yout = ; } int jbittream3decoder(int xin) { // Moore type FA // Inputs: xin, reset, Outputs: y_out yout = ; statereg = nexttate; switch (statereg) { case s: if (xin == ); if (xin == ) nexttate = s; break; case s: if (xin == ) nexttate = s; if (xin == ) nexttate = s2; break; case s2: if (xin == ) nexttate = s3; if (xin == ); break; case s3: yout = ; if (xin == ) nexttate = s; if (xin == ) nexttate = s; break; default: // Error section yout = ; nexttate = s; }// switch() END return (yout); }// jbittream3decoder() END }// JBittream3Decoder class END Java BEM4DEP Digital Control of Electric Drives - 4 4
41 Detector of bit equence (FM Moore Model) entity vbittream3decoder is Port ( clk : in TD_LOGIC; x_in : in TD_LOGIC; y_out : out TD_LOGIC; reset : in TD_LOGIC; q : out std_logic_vector( downto ) ); end vbittream3decoder; architecture Behavioral of vbittream3decoder is type states is (s,s2,s3,s4); signal statereg, nexttate: states:= s; begin -- FA - Finite tate Machine process(clk, reset) begin if reset = '' then statereg <= s; elsif clk'event and clk = '' then statereg <= nexttate; end if; end process; process(statereg, x_in) -- tate diagram definition begin nexttate <= statereg; case statereg is when s => if x_in = '' then nexttate <= s2; end if; when s2 => if x_in = '' then nexttate <= s; elsif x_in = '' then nexttate <= s3; end if; when s3 => if x_in = '' then nexttate <= s3; elsif x_in = '' then nexttate <= s4; end if; when s4 => if x_in = '' then nexttate <= s2; elsif x_in = '' then nexttate <= s; end if; VHDL when others => nexttate <= statereg; end case; end process; process(statereg) -- Output function begin case statereg is when s => y_out <= ''; when s2 => y_out <= ''; when s3 => y_out <= ''; when s4 => y_out <= ''; when others => null; end case; end process; end Behavioral; BEM4DEP Digital Control of Electric Drives - 4 4
42 Detector of bit equence (FM Mealy Model) Design synchronous finite state machine (FM) (Mealy model) which detects sequence in input bit flow. FM will output impulse when each such sequence will be detected. Design FM with asynchronous reset. (Mealy) clk x y BEM4DEP Digital Control of Electric Drives
43 Detector of bit equence (FM Mealy Model) What ought to be designed? FM Mealy Compare vs FM Moore BEM4DEP Digital Control of Electric Drives
44 Detector of bit equence (FM Mealy Model) tate Diagram I / = / I Inputs O Outputs i i-th state I / = / I / = / I / = / I / = / Transition Table i I I I / = / Output Table i I I O O O O O O BEM4DEP Digital Control of Electric Drives
45 Detector of bit equence (FM Mealy Model) Transition Table i I I tate Coding i I i+ i q q x d d i+ x q q Next-state Function clock d tate Register d D Q q D Q q Feedback BEM4DEP Digital Control of Electric Drives
46 Detector of bit equence (FM Mealy Model) Output Table i I I O O O O O O i I O Output Coding i q q x y BEM4DEP Digital Control of Electric Drives
47 Detector of bit equence (FM Mealy Model) d x d x q q q q d = qx + qx d = q q x Minimization y q q x y = q q x BEM4DEP Digital Control of Electric Drives
48 Detector of bit equence (FM Mealy Model) Implementation BEM4DEP Digital Control of Electric Drives
49 Detector of bit equence (FM Mealy Model) What was designed? BEM4DEP Digital Control of Electric Drives
50 Detector of bit equence (FM Mealy Model) What was designed? Next-state Function tate Register Output Function LCC LCC2 BEM4DEP Digital Control of Electric Drives - 4 5
51 Digital Control of Electric Drives Logic Circuits - equential Description Form, Finite tate Machine (FM) END Czech Technical University in Prague Faculty of Electrical Engineering
UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017
UNIVERSITY OF BOLTON TW35 SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER 2-2016/2017 INTERMEDIATE DIGITAL ELECTRONICS AND COMMUNICATIONS MODULE NO: EEE5002
More informationPreparation of Examination Questions and Exercises: Solutions
Questions Preparation of Examination Questions and Exercises: Solutions. -bit Subtraction: DIF = B - BI B BI BO DIF 2 DIF: B BI 4 6 BI 5 BO: BI BI 4 5 7 3 2 6 7 3 B B B B B DIF = B BI ; B = ( B) BI ( B),
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationModels for representing sequential circuits
Sequential Circuits Models for representing sequential circuits Finite-state machines (Moore and Mealy) Representation of memory (states) Changes in state (transitions) Design procedure State diagrams
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More informationDifferent encodings generate different circuits
FSM State Encoding Different encodings generate different circuits no easy way to find best encoding with fewest logic gates or shortest propagation delay. Binary encoding: K states need log 2 K bits i.e.,
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationEECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007
EECS 150 - Components and Design Techniques for Digital Systems FSMs 9/11/2007 Sarah Bird Electrical Engineering and Computer Sciences University of California, Berkeley Slides borrowed from David Culler
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationAppendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs
Appendix B Review of Digital Logic Baback Izadi Division of Engineering Programs bai@engr.newpaltz.edu Elect. & Comp. Eng. 2 DeMorgan Symbols NAND (A.B) = A +B NOR (A+B) = A.B AND A.B = A.B = (A +B ) OR
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering SEQUENTIAL CIRCUITS: LATCHES Overview Circuits require memory to store intermediate
More informationCh 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationSynchronous Sequential Circuit Design. Digital Computer Design
Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always
More informationECE 448 Lecture 6. Finite State Machines. State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code. George Mason University
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code George Mason University Required reading P. Chu, FPGA Prototyping by VHDL Examples
More informationENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter. Lab 3. Lab 3 Gate Timing. Lab 3 Steps in designing a State Machine. Timing diagram of a DFF
ENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter Timing diagram of a DFF Lab 3 Gate Timing difference timing for difference kind of gate, cost dependence (1) Setup Time = t2-t1 (2) Propagation
More informationLecture 10: Synchronous Sequential Circuits Design
Lecture 0: Synchronous Sequential Circuits Design. General Form Input Combinational Flip-flops Combinational Output Circuit Circuit Clock.. Moore type has outputs dependent only on the state, e.g. ripple
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Synchronous Sequential Circuits Basic Design Steps CprE 281: Digital Logic Iowa State University, Ames,
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Following the slides of Dr. Ahmed H. Madian Lecture 10 محرم 1439 ه Winter
More informationSpiral 2-1. Datapath Components: Counters Adders Design Example: Crosswalk Controller
2-. piral 2- Datapath Components: Counters s Design Example: Crosswalk Controller 2-.2 piral Content Mapping piral Theory Combinational Design equential Design ystem Level Design Implementation and Tools
More informationECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview
407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation
More informationSequential vs. Combinational
Sequential Circuits Sequential vs. Combinational Combinational Logic: Output depends only on current input TV channel selector (-9) inputs system outputs Sequential Logic: Output depends not only on current
More informationEECS150 - Digital Design Lecture 23 - FSMs & Counters
EECS150 - Digital Design Lecture 23 - FSMs & Counters April 8, 2010 John Wawrzynek Spring 2010 EECS150 - Lec22-counters Page 1 One-hot encoding of states. One FF per state. State Encoding Why one-hot encoding?
More informationvidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
More informationELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
More informationLecture 7: Logic design. Combinational logic circuits
/24/28 Lecture 7: Logic design Binary digital circuits: Two voltage levels: and (ground and supply voltage) Built from transistors used as on/off switches Analog circuits not very suitable for generic
More informationWritten reexam with solutions for IE1204/5 Digital Design Monday 14/
Written reexam with solutions for IE204/5 Digital Design Monday 4/3 206 4.-8. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 08-7904487 Exam text does not have to be returned
More informationDigital Logic and Design (Course Code: EE222) Lecture 19: Sequential Circuits Contd..
Indian Institute of Technology Jodhpur, Year 2017-2018 Digital Logic and Design (Course Code: EE222) Lecture 19: Sequential Circuits Contd.. Course Instructor: Shree Prakash Tiwari Email: sptiwari@iitj.ac.in
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
More informationSynchronous Sequential Circuit
Synchronous Sequential Circuit The change of internal state occurs in response to the synchronized clock pulses. Data are read during the clock pulse (e.g. rising-edge triggered) It is supposed to wait
More informationEECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary
EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2
More informationCE1911 LECTURE FSM DESIGN PRACTICE DAY 1
REVIEW MATERIAL 1. Combinational circuits do not have memory. They calculate instantaneous outputs based only on current inputs. They implement basic arithmetic and logic functions. 2. Sequential circuits
More informationLecture 3 Review on Digital Logic (Part 2)
Lecture 3 Review on Digital Logic (Part 2) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ ircuit Optimization Simplest implementation ost criterion literal
More informationComputers also need devices capable of Storing data and information Performing mathematical operations on such data
Sequential Machines Introduction Logic devices examined so far Combinational Output function of input only Output valid as long as input true Change input change output Computers also need devices capable
More informationPin Details of Digital Logic Gates:
(1) (2) Pin Details of Digital Logic Gates: (3) Postulates and Theorems of Boolean algebra: S. No Postulate/Theorem Duality Remarks 1. X + 0 = X X.1 = X - 2. X + X = 1 X.X = 0-3. X + X = X X.X = X - 4.
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
More informationSynchronous Sequential Logic Part I. BME208 Logic Circuits Yalçın İŞLER
Synchronous Sequential Logic Part I BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Sequential Logic Digital circuits we have learned, so far, have been combinational no memory,
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
More informationI. Motivation & Examples
I. Motivation & Examples Output depends on current input and past history of inputs. State embodies all the information about the past needed to predict current output based on current input. State variables,
More informationCOE 328 Final Exam 2008
COE 328 Final Exam 2008 1. Design a comparator that compares a 4 bit number A to a 4 bit number B and gives an Output F=1 if A is not equal B. You must use 2 input LUTs only. 2. Given the following logic
More informationExample: vending machine
Example: vending machine Release item after 15 cents are deposited Single coin slot for dimes, nickels o change Reset Coin Sensor Vending Machine FSM Open Release Mechanism Clock Spring 2005 CSE370 - guest
More informationLecture 8: Sequential Networks and Finite State Machines
Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Spring 2014 CK Cheng, Diba Mirza Dept. of Computer Science and Engineering University
More informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationSequential Circuit Analysis
Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationCounters. We ll look at different kinds of counters and discuss how to build them
Counters We ll look at different kinds of counters and discuss how to build them These are not only examples of sequential analysis and design, but also real devices used in larger circuits 1 Introducing
More informationLatches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
More informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 DEPARTMENT: EEE QUESTION BANK SUBJECT NAME: DIGITAL LOGIC CIRCUITS SUBJECT CODE: EE55 SEMESTER IV UNIT : Design of Synchronous Sequential Circuits PART
More informationSequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science
Sequential Logic Rab Nawaz Khan Jadoon DCS COMSATS Institute of Information Technology Lecturer COMSATS Lahore Pakistan Digital Logic and Computer Design Sequential Logic Combinational circuits with memory
More informationCSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid
CSE140: Components and Design Techniques for Digital Systems Midterm Information Instructor: Mohsen Imani Midterm Topics In general: everything that was covered in homework 1 and 2 and related lectures,
More informationParity Checker Example. EECS150 - Digital Design Lecture 9 - Finite State Machines 1. Formal Design Process. Formal Design Process
Parity Checker Example A string of bits has even parity if the number of 1 s in the string is even. Design a circuit that accepts a bit-serial stream of bits and outputs a 0 if the parity thus far is even
More informationIntroduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A Flip-Flop stores one bit of information
More informationFinite State Machine (FSM)
Finite State Machine (FSM) Consists of: State register Stores current state Loads next state at clock edge Combinational logic Computes the next state Computes the outputs S S Next State CLK Current State
More informationCombinational vs. Sequential. Summary of Combinational Logic. Combinational device/circuit: any circuit built using the basic gates Expressed as
Summary of Combinational Logic : Computer Architecture I Instructor: Prof. Bhagi Narahari Dept. of Computer Science Course URL: www.seas.gwu.edu/~bhagiweb/cs3/ Combinational device/circuit: any circuit
More information(Boolean Algebra, combinational circuits) (Binary Codes and -arithmetics)
Task 1. Exercises: Logical Design of Digital Systems Seite: 1 Self Study (Boolean Algebra, combinational circuits) 1.1 Minimize the function f 1 a ab ab by the help of Boolean algebra and give an implementation
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Sequential circuit: A circuit that includes memory elements. In this case the output depends not only on the current input but also on the past inputs. Memory A synchronous
More informationMemory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
More informationEEE2135 Digital Logic Design
EEE2135 Digital Logic Design Chapter 7. Sequential Circuits Design 서강대학교 전자공학과 1. Model of Sequential Circuits 1) Sequential vs. Combinational Circuits a. Sequential circuits: Outputs depend on both the
More information7 Multipliers and their VHDL representation
7 Multipliers and their VHDL representation 7.1 Introduction to arithmetic algorithms If a is a number, then a vector of digits A n 1:0 = [a n 1... a 1 a 0 ] is a numeral representing the number in the
More informationSynchronous Sequential Circuit Design. Dr. Ehab A. H. AL-Hialy Page 1
Synchronous Sequential Circuit Design Dr. Ehab A. H. AL-Hialy Page Motivation Analysis of a few simple circuits Generalizes to Synchronous Sequential Circuits (SSC) Outputs are Function of State (and Inputs)
More informationEECS150 - Digital Design Lecture 16 Counters. Announcements
EECS150 - Digital Design Lecture 16 Counters October 20, 2011 Elad Alon Electrical Engineering and Computer Sciences University of California, Berkeley http://www-inst.eecs.berkeley.edu/~cs150 Fall 2011
More informationDigital Circuits ECS 371
Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
More informationSynchronous Sequential Logic Part I
Synchronous Sequential Logic Part I Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Sequential Logic Digital circuits we have learned, so far, have been combinational no memory, outputs are entirely
More informationChapter 7. Sequential Circuits Registers, Counters, RAM
Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage
More informationCPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic
CPE/EE 422/522 Chapter - Review of Logic Design Fundamentals Dr. Rhonda Kay Gaede UAH UAH Chapter CPE/EE 422/522. Combinational Logic Combinational Logic has no control inputs. When the inputs to a combinational
More informationFSM model for sequential circuits
1 FSM model for sequential circuits The mathematical model of a sequential circuit is called finite-state machine. FSM is fully characterized by: S Finite set of states ( state ~ contents of FFs) I Finite
More informationDigital Design. Sequential Logic
Principles Of igital esign Chapter 6 Sequential Logic Chapter preview Boolean algebra 3 Logic gates and flip-flops 3 Finite-state machine 6 Logic design techniques 4 Sequential design techniques 6 Binary
More information3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
More informationLecture 17: Designing Sequential Systems Using Flip Flops
EE210: Switching Systems Lecture 17: Designing Sequential Systems Using Flip Flops Prof. YingLi Tian April 11, 2019 Department of Electrical Engineering The City College of New York The City University
More informationLab #10: Design of Finite State Machines
Lab #10: Design of Finite State Machines ECE/COE 0501 Date of Experiment: 3/1/2017 Report Written: 3/4/2017 Submission Date: 3/15/2017 Nicholas Haver nicholas.haver@pitt.edu 1 H a v e r PURPOSE The purpose
More informationWritten exam with solutions IE1204/5 Digital Design Friday 13/
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
More informationAdders allow computers to add numbers 2-bit ripple-carry adder
Lecture 12 Logistics HW was due yesterday HW5 was out yesterday (due next Wednesday) Feedback: thank you! Things to work on: ig picture, ook chapters, Exam comments Last lecture dders Today Clarification
More informationAcknowledgment. DLD Lab. This set of slides on VHDL are due to Brown and Vranesic.
Acknowledgment DLD Lab Thi et o lide on VHDL are due to Brown and Vraneic. Introduction to VHDL (Very High Speed Integrated Circuit Hardware Decription Language) 2 3 A imple logic unction and correponding
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences Introductory Digital Systems Lab (6.111) Quiz #1 - Spring 2003 Prof. Anantha Chandrakasan and Prof. Don
More informationClocked Synchronous State-machine Analysis
Clocked Synchronous State-machine Analysis Given the circuit diagram of a state machine: Analyze the combinational logic to determine flip-flop input (excitation) equations: D i = F i (Q, inputs) The input
More informationGates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
More informationEECS150 - Digital Design Lecture 18 - Counters
EECS150 - Digital Design Lecture 18 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150 - Lec18-counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.
More informationEECS150 - Digital Design Lecture 18 - Counters
EECS50 - Digital Design Lecture 8 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS50 - Lec8-counters Page Counters Special sequential circuits (FSMs) that sequence though a set outputs. Examples:
More informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationDr. Nicola Nicolici COE/EE2DI4 Midterm Test #2 Nov 22, 2006
COE/EE2DI4 Midterm Test #2 Fall 2006 Page 1 Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #2 Nov 22, 2006 Instructions: This examination paper includes 12 pages and 20 multiple-choice questions starting
More informationTopic 8: Sequential Circuits
Topic 8: Sequential Circuits Readings : Patterson & Hennesy, Appendix B.4 - B.6 Goals Basic Principles behind Memory Elements Clocks Applications of sequential circuits Introduction to the concept of the
More informationChapter 6 Introduction to state machines
9..7 hapter 6 Introduction to state machines Dr.-Ing. Stefan Werner Table of content hapter : Switching Algebra hapter : Logical Levels, Timing & Delays hapter 3: Karnaugh-Veitch-Maps hapter 4: ombinational
More informationSequential Logic Design: Controllers
Sequential Logic Design: Controllers Controller Design, Flip Flop Timing Copyright (c) 2012 Sean Key Standard Controller Architecture Controller A circuit that implements a FSM is referred to as a controller
More informationTable of Content. Chapter 11 Dedicated Microprocessors Page 1 of 25
Chapter 11 Dedicated Microprocessors Page 1 of 25 Table of Content Table of Content... 1 11 Dedicated Microprocessors... 2 11.1 Manual Construction of a Dedicated Microprocessor... 3 11.2 FSM + D Model
More informationor 0101 Machine
Synchronous State Graph or Synchronous State Graph or Detector Design a state graph for a machine with: One input X, one output Z. Z= after receiving the complete sequence or Overlapped sequences are detected.
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationEECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization
EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Discrete Systems Lecture: Automata, State machines, Circuits Stavros Tripakis University of California, Berkeley Stavros
More informationCOEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University
1 OEN 312 DIGIAL SYSEMS DESIGN - LEURE NOES oncordia University hapter 6: Registers and ounters NOE: For more examples and detailed description of the material in the lecture notes, please refer to the
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationCombinational Logic Design Combinational Functions and Circuits
Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders
More informationL10 State Machine Design Topics
L State Machine Design Topics States Machine Design Other topics on state machine design Equivalent sequential machines Incompletely specified machines One Hot State Machines Ref: text Unit 15.4, 15.5,
More informationCPE100: Digital Logic Design I
Chapter 3 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe1/ CPE1: Digital Logic Design I Section 14: Dr. Morris Sequential Logic Design Chapter 3 Chapter
More informationSequential Circuits. Circuits with state. Silvina Hanono Wachman Computer Science & Artificial Intelligence Lab M.I.T. L06-1
Sequential Circuits Circuits with state Silvina Hanono Wachman Computer Science & Artificial Intelligence Lab M.I.T. L06-1 Combinational circuits A 0 A 1 A n-1. Sel lg(n) O Mux A B Comparator Result: LT,
More information