1 / 17

FLIP-FLOPS CS147 Presentation

FLIP-FLOPS CS147 Presentation. CS 147 Ying Zuo. FLIP-FLOPS. The simplest finite state machine Storage element - compensates the weakness of combination circuits - outputs depend on both current and previous inputs. (Sequential Circuit) Edge triggered

mallory-daniels
Download Presentation

FLIP-FLOPS CS147 Presentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. FLIP-FLOPSCS147 Presentation CS 147 Ying Zuo

  2. FLIP-FLOPS • The simplest finite state machine • Storage element - compensates the weakness of combination circuits - outputs depend on both current and previous inputs. (Sequential Circuit) • Edge triggered (latch: level triggered)

  3. FINITE MACHINE • A computational model consisting of a finite number of states and transitions between those states, possibly with accompanying actions.

  4. Outputs of FSM 1. Moore Finite State Machine • Associate output with each state • Function of current state

  5. 2. Mealy Finite State Machine • Associate output with each transaction • Function of current state and its input

  6. CHARACTERISTIC TABLES D flip-flops T flip-flops JK flip-flops SR flip-flops

  7. State Transition Table • Also known as characteristic table. • In sequential logic, a state transition table is a table showing what state a finite state machine will move to, based on the current state and other inputs. • Four columns: current state, input, output, and next state.

  8. Example

  9. Implementing this FSM using a T Flip-Flop Q(t+1) Input of T in order to get to Q(t+1) T=X*Q*+XQ

  10. Sequential Circuit X T=Q*X*+QX Y=Q Q* Clk

  11. Implementing this FSM using a D Flip-Flop Q(t+1) D D=X*

  12. Sequential Circuit X D=X* Y=Q Q* Clk

  13. Implementing JK Flip-Flop using a T Flip-Flop JK flip-flops T FFs T=JQ*+KQ

  14. Practice: Draw the Sequential Circuit

  15. Implementing T Flip-Flop using a JK Flip-Flop T FFs

  16. Cont. J=T K=T*

  17. How to draw the Sequential Circuit ?

More Related