Hardware and Software Optimization of BANSMOM System

1. RPS Hardware and Software Optimization of BANSMOM System Period-Peaks Detection Algorithm Functions - Finding peaks - s1150072 Yumiko Kimezawa

2. outline RPS • Previous work • Finding interval • Finding peaks • Finding positive peaks • Finding negative peaks • Finding R peak • Finding P peak • Finding T peak • Finding U peak • Finding Q peak • Finding S peak • Future work

3. PPD Algorithm-Processing flow- RPS Reading data Derivation Peak detection Autocorrelation Store result Find interval

4. outline RPS • Previous work • Finding interval • Finding peaks • Finding positive peaks • Finding negative peaks • Finding R peak • Finding P peak • Finding T peak • Finding U peak • Finding Q peak • Finding S peak • Future work

5. Previous work RPS Reading data Derivation Peak detection Autocorrelation Store result Find interval

6. Processing flow–Finding interval- RPS Find maximum value Reduce negative value Sort basing points Peak detection from ACF result Calculate interval Find basing points Renew next start index

7. outline RPS • Previous work • Finding interval • Finding peaks • Finding positive peaks • Finding negative peaks • Finding R peak • Finding P peak • Finding T peak • Finding U peak • Finding Q peak • Finding S peak • Future work

8. Peak Detection RPS Reading data Derivation Peak detection Autocorrelation Store result Find interval

9. Processing flow –Finding peaks- RPS Finding positive peaks Finding negative peaks Finding T peak Finding R peak Finding U peak Finding Q peak Finding P peak Finding S peak

10. Processing flow–Finding positive and negative peaks- RPS Finding positive peaks Finding negative peaks Finding T peak Finding R peak Finding U peak Finding Q peak Finding P peak Finding S peak

11. Finding positive and negative peaks RPS • Finding positive peaks • Count positive peaks • Store address of positive peaks • Finding negative peaks • Count negative peaks • Store address of negative peak positive I gather that it is easier to find each peak by dividing all peaks into two groups positive and negative. negative

12. Processing flow-Finding positive and negative peaks- RPS Finding positive peaks Finding negative peaks Finding T peak Finding R peak Finding U peak Finding Q peak Finding P peak Finding S peak

13. Finding R peak RPS • The maximum value is found from among positive peaks in an interval • The peak is identified as the R peak • The value (peak_value.r) and point (peak_point.r) of the R peak are stored

14. Finding P peak RPS • The maximum value is found from among positive peaks from the start to max_value_index • The peak is identified as the P peak • The value (peak_value.p) and point (peak_point.p) of the P peak are stored max_value_index

15. Finding T peak RPS • The maximum value is found from among positive peaks from max_value_index + 1 to end • The peak is identified as the T peak • The value (peak_value.t) and point (peak_point.t) of the T peak are stored max_value_index

16. Finding U peak RPS • The maximum value is found from among positive peaks from t_wave_index + 1 to end • The peak is identified as the U peak • The value (peak_value.u) and point (peak_point.u) of the U peak are stored t_wave_index

17. Finding Q peak RPS • The negative peak closest to the R peak is found from among negative peaks from start to peak_point.r • The peak is identified as the Q peak • The value (peak_value.q) and point (peak_point.q) of the Q peak are stored peak_point.r

18. Finding S peak RPS • The negative peak closest to the R peak is found from among negative peaks from peak_point.r to end • The peak is identified as the S peak • The value (peak_value.s) and point (peak_point.s) of the S peak are stored peak_point.r

19. Future work RPS • Analysis software and hardware part