中国高校课件下载中心 》 教学资源 》 大学文库

《数字电》英文版 chapter4-1 Flip-flops

文档信息
资源类别:文库
文档格式:PPT
文档页数:77
文件大小:954.5KB
团购合买:点击进入团购
内容简介
FLIP-FLOPS Flip-flops are digital devices that have the ability to store binary information after the excitation input has changed. They are considered to be the basic memory cell for the majority of electronic binary data storage applications. This section explores the flip-flop from a functional perspective.
刷新页面文档预览

Flip-flops Chapter4 Flip-flops

Flip-flops Chapter4 Flip-flops

Flip-flops are digital devices that have the ability to store binary information after the excitation input has changed They are considered to be the basic memory cell for the majority of electronic binary data storage applIcations a This section explores the flip-flop from a functional perspective

◼ Flip-flops are digital devices that have the ability to store binary information after the excitation input has changed. ◼ They are considered to be the basic memory cell for the majority of electronic binary data storage applications. ◼ This section explores the flip-flop from a functional perspective

TFLP-FLO

R S Q’ Q

a Two output Q and Q. And Q is the complement of Two stable state, either aO or a 1." Q=1 is the state-1 and Q=0"is the state- 0. the state would be remained without the changing of input variables a By the excitation of certain input variables, flip flop changes from one stable state to another stable state. the state prior to the excitation of input is present-state, represented by symbol "o(Q the state after the excitation of input is next-state, represented by symbol Qn+lo

◼ Two output Q and Q’. And Q’ is the complement of Q. ◼ Two stable state, either a 0 or a 1. “Q=1” is the state-1 and “Q=0” is the state-0. The state would be remained without the changing of input variables . ◼ By the excitation of certain input variables, flip￾flop changes from one stable state to another stable state. The state prior to the excitation of input is present-state, represented by symbol “Qn (Q)”, the state after the excitation of input is next-state, represented by symbol “Qn+1

Four types of flip-flops are commonly considered: JK, SR, D and T a Each store binary data but have a unique set of input variables a each flip-flop can be described in terms f input and output characteristics by writing special truth table called an excitation table A characteristics equation can be generated from the excitation tables

◼ Four types of flip-flops are commonly considered: JK, SR, D and T. ◼ Each store binary data but have a unique set of input variables. ◼ Each flip-flop can be described in terms of input and output characteristics by writing special truth table ,called an excitation table. ◼ A characteristics equation can be generated from the excitation tables

Flip-flops vs Latches a the names flip-flops and latches are sometimes used interchangeably: a flip-flops are clocked and latch are not a The term"flip-flop"is more appropriately associated with devices change state only on a clock edge or pulse, whereas latches change state without being clocked

•Flip-flops vs Latches ◼ The names flip-flops and latches are sometimes used interchangeably; ◼ Flip-flops are clocked and latch are not. ◼ The term “flip-flop” is more appropriately associated with devices change state only on a clock edge or pulse, whereas latches change state without being clocked

R-S NAND Latch ■ Analysis Q 口R=1,S=1Q=(SQ)y=Q Qn+=(RQ'=Q 口R=1,S=0Qm+=1 Q n+1 R 口R=0,5=1Qm1=0 Qm1=1 Q 口R=0,S=0Qm=1 Q+1=1

• R -S NAND Latch ◼ Analysis  R=1, S=1 Qn+1=(SQ’)’=Q; Qn+1’=(RQ)’=Q’;  R=1, S=0 Qn+1=1; Qn+1’=0;  R=0, S=1 Qn+1=0; Qn+1’=1;  R=0, S=0 Qn+1=1; Qn+1’=1; R S Q’ Q RS Q’ Q

Present state 0=0 =1 R=0,S=1 & & 0R01S1 Output next state 0=0 =1

& a & b Q' Q R S R=0, S=1 Q = 0 Q'= 1 1 1 0 0 1 0 1 0 Output next state Q = 0 Q'= 1 Present state

Present state 0=1 0=0 R=0.S=1 0 & & a O R Output next state 0=00=1

& a & b Q' Q R S R=0, S=1 Q = 1 Q'= 0 0 1 1 1 1 0 1 0 Output next state Q = 0 Q'= 1 Present state

Present state 0=00=1 R=1,S=0 0 Q & & 1 R 1 1S0 Output next state 0=1 0=0

R=1, S=0 Q = 0 Q'= 1 1 0 1 1 0 0 1 1 Output next state Q = 1 Q'= 0 & a & b Q' Q R S Present state

刷新页面下载完整文档
VIP每日下载上限内不扣除下载券和下载次数;
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
相关文档