Hardware and Software Optimization of BANSMOM System

Period-Peaks Detection Algorithm Functions

- Finding peaks -

July 26, 2010 RPS 1

s1150072 Yumiko Kimezawa

outline

July 26, 2010 RPS 2

•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

PPD Algorithm-Processing flow-

July 26, 2010 RPS 3

Reading data

Derivation

Autocorrelation

Find interval

Peak detection

Store result

outline

July 26, 2010 RPS 4

•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

Previous work

July 26, 2010 RPS 5

Reading data

Derivation

Autocorrelation

Find interval

Peak detection

Store result

Processing flow–Finding interval-

July 26, 2010 RPS 6

Find maximum value

Reduce negative value

Peak detection from ACF result

Find basing points

Sort basing points

Calculate interval

Renew next start index

outline

July 26, 2010 RPS 7

•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

Peak Detection

July 26, 2010 RPS 8

Reading data

Derivation

Autocorrelation

Find interval

Peak detection

Store result

Processing flow –Finding peaks-

July 26, 2010 RPS 9

Finding positive peaks

Finding negative peaks

Finding R peak

Finding P peak

Finding T peak

Finding U peak

Finding Q peak

Finding S peak

Processing flow–Finding positive and negative peaks-

July 26, 2010 RPS 10

Finding positive peaks

Finding negative peaks

Finding R peak

Finding P peak

Finding T peak

Finding U peak

Finding Q peak

Finding S peak

Finding positive and negative peaks

July 26, 2010 RPS 11

•Finding positive peaks-Count positive peaks-Store address of positive peaks

•Finding negative peaks-Count negative peaks-Store address of negative peak

positive

negative

I gather that it is easier to find each peak by dividing all peaks into two groups positive and negative.

Processing flow-Finding positive and negative peaks-

July 26, 2010 RPS 12

Finding positive peaks

Finding negative peaks

Finding R peak

Finding P peak

Finding T peak

Finding U peak

Finding Q peak

Finding S peak

Finding R peak

July 26, 2010 RPS 13

•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

Finding P peak

July 26, 2010 RPS 14

max_value_index

•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

Finding T peak

July 26, 2010 RPS 15

max_value_index

•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

Finding U peak

July 26, 2010 RPS 16

t_wave_index

•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

Finding Q peak

July 26, 2010 RPS 17

peak_point.r

•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

Finding S peak

July 26, 2010 RPS 18

peak_point.r

•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

Future work

July 26, 2010 RPS 19

•Analysis software and hardware part