1 / 11

OBAS - continued

OBAS - continued. Inputs : x k Outputs : y k Registers : no Parameters : DM, HM Test Remarks. OBTR. Purpose Algorithm : if abs(xk - yk1)<=d then yk=xk else yk=yk1+sign(xk-yk)*d. OBTR - continued. Inputs : xk Outputs : yk Registers : yk1 Parameters : d

silver
Download Presentation

OBAS - continued

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. OBAS - continued • Inputs : xk • Outputs : yk • Registers : no • Parameters : DM, HM • Test • Remarks

  2. OBTR • Purpose • Algorithm : if abs(xk - yk1)<=d then yk=xk else yk=yk1+sign(xk-yk)*d

  3. OBTR - continued • Inputs : xk • Outputs : yk • Registers : yk1 • Parameters : d • Test • Remarks

  4. TSTH • Purpose • Algorithm: if xk>=DM and xk<=HM then AD=0, AH=0 if xk>HHM then AH=1 if xk<DDM then AD=1

  5. TSTH - continued • Inputs : xk • Outputs : AD, AH • Registers : no • Parameters : DM, DDM, HM, HHM • Test • Remarks

  6. FLPV -conditional • Purpose • Algorithm: F=T/(T+tau) if abs(xk-yk)<=d then yk=xk else yk=xk*F+yk1*(1-F) yk1=yk

  7. FLPV - conditional - continued • Inputs : xk • Outputs : yk • Registers : F, yk1 • Parameters : tau,T,d • Test • Remarks

  8. LEAD/LAG • Purpose • Algorithm: F(s)= (1+Td*s)/(1+Ti*s) F1=Ti/(T+Ti); F2=(Td+T)/(T+Ti); F3= -Td/(T+Ti) yk=F1*yk1+F2*xk+F3*xk1 xk1=xk yk1=yk

  9. LEAD/LAG - continued • Inputs : xk • Outputs : yk • Registers : F1, F2, F3,yk1, xk1 • Parameters: Ti, Td, T • Test • Remarks

  10. DTIME • Purpose • Algorithm: Circle Buffer n = int (D / T) zac: i=i+1 output yk input x[ i ] if i = n then i = 0 go to zac

  11. DTIME - continued • Inputs : xi • Outputs : yk • Registers : n, k, x[1:n] • Parameters: D, T • Test • Remarks

More Related