DOC PREVIEW
Berkeley COMPSCI 150 - Lecture Notes

This preview shows page 1-2-3 out of 10 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

EECS 150 - Components and Design Techniques for Digital SystemsLec 11 – Putting it all together…10-5-04David CullerElectrical Engineering and Computer SciencesUniversity of California, BerkeleyPresented by: Kaushik Ravindranhttp://www.eecs.berkeley.edu/~cullerhttp://www-inst.eecs.berkeley.edu/~cs150Outline• Top-to-bottom– What have we covered so far?• Combo Lock example – Hw 4– FSM to logic– Mapping to FPGAs• Counters revisited• Announcements• Another example – Ant BrainDigital design - as we’ve seen itSystem specification (in words)Datapath specificationController specificationComb. logic operationsVerilog dataflowGates / LUTsFSM generationSTT / STD / EncodingLogic: nextstate/outputsVerilog behaviorGates / LUTs / FFARTARTLec 7, 8: FSM impl.Lec 8, 9: Modeling FSMsLec 5, 6: Logic min.Lec 4: HDL, LabsLec 2, 3: CMOS, FPGALec 5, 6: Logic min.Lec 4: HDLs, LabsLec 2, 3: CMOS, FPGAWhere are we now?• (Synchronous) Sequential systems• Given datapath and control specifications– Generate comb. logic for datapath» Minimize logic for efficient implementation– Generate FSM for controller» Choose implementation, encoding» Generate logic for nextstate and output– Describe datapath and controller in Verilog» structure, dataflow and behavior» Map onto gates or LUTs• Seems like a good point to “test” your understanding!Sequential Logic Implementation• Models for representing sequential circuits– Finite-state machines (Moore and Mealy)– Representation of memory (states)– Changes in state (transitions)• Design procedure– State diagrams– Implementation choice: counters, shift registers, FSM– State transition table– State encoding– Combinational logic» Next state functions» Output functionsAbstraction of State Elements• Divide circuit into combinational logic and state• Localize feedback loops and make it easy to break cycles• Implementation of storage elements leads to various forms of sequential logic       Forms of Sequential Logic• Asynchronous sequential logic – state changes occur whenever state inputs change (elements may be simple wires or delay elements)• Synchronous sequential logic – state changes occur in lock step across all storage elements (using a periodic waveform - the clock)• States: determined by possible values in sequential storage elements• Transitions: change of state• Clock: controls when state can change by controlling storage elements• Sequential Logic– Sequences through a series of states– Based on sequence of values on input signals– Clock period defines elements of sequenceFSM RepresentationsExample: FSM Design – Combo lock• Combination lock from first lecture       resetopen/closednewC1 C2 C3comparatorvalueequalmultiplexerequalcontrollermuxcontrolclockdatapathController       !!"   #$Combo lock - controller implementation• Implementation of the controllerCombo Lock - State Encoding       % % %      %            && %       ' '   %  '  ' '     ' & & %     '  ( (   %  (  ( (     (  && %     (  ) * %  % %  )*  )* %  % %  & &  && % Symbolic states and outputs+  ,!'!(-.# /  , ! '! (! ) * !  , ! One possible encoding     Concrete encodingFSM implementation• Steps for the hardware designer:– Word specification– FSM design– Encoding– Verification!• At this point, hand over to synthesis tools:– Describe FSM behavior in Verilog– Synthesize controller • Good encoding– Better performance– Fewer state bits– Possibility of state minimization– Tools also try to figure this outFor this example, go through the logic synthesis steps (ideally, tools take care of all this)…Example: Combo Lock – Hw


View Full Document

Berkeley COMPSCI 150 - Lecture Notes

Documents in this Course
Lab 2

Lab 2

9 pages

Debugging

Debugging

28 pages

Lab 1

Lab 1

15 pages

Memory

Memory

13 pages

Lecture 7

Lecture 7

11 pages

SPDIF

SPDIF

18 pages

Memory

Memory

27 pages

Exam III

Exam III

15 pages

Quiz

Quiz

6 pages

Problem

Problem

3 pages

Memory

Memory

26 pages

Lab 1

Lab 1

9 pages

Memory

Memory

5 pages

Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?