Skip to main content
. 2017 Nov 8;17(11):2573. doi: 10.3390/s17112573
Algorithm 2. Peak update (thu, Sk−1, Sk)
  If Sn−1 == Sn
   If Sn =1 && (tapeakk − tapeakk−1 < thu) && apeakk> apeakk−1
   Return(update-peak)
   Elseif Sn = −1 && (tavalleyk − tavalleyk−1< thu) && avalleyk< avalleyk−1
   Return(update-valley)
  Else
   Return(no-update)