. 2014 Apr 9;14(4):6535–6566. doi: 10.3390/s140406535

Table 5.

The total computational complexity of each implemented algorithm. For definitions of the variables, see Table 2.

Algorithm

Multiplications

Additions

Algorithm 1

N(2log₂N + 1) + 3N_b + N_p(3B_crest + 2N_itN + 2)

3 N {log}_{2} N + 6 N_{b} + N_{p}^{2} + N_{p} (3 B_{crest} + 2 N_{itN} - 2) + N_{c} (M_{cont} + 1)

Algorithm 2

N(2log₂N + 1) +3N_b + N_p(B_crest +B_narrow+ B_wide +6N_itNR + 2)

3 N {log}_{2} N + 6 N_{b} + N_{p}^{2} + N_{p} (B_{crest} + B_{narrow} + B_{wide} + 2 (N_{itNR} + 1) - 3) + N_{c} (M_{cont} + 1)

Algorithm 3

N(2log₂N +1)+N_b(2(2N_itTA −1)² +(2N_itTC −2)(2N_itTC − 1) + 4N_itN + 6N_itNR + 9) + N_itTL(N_itTL + 1)/2

3Nlog₂N +N_b(4N_itN +N_itTC +N_itTA+ N_itNR +5)+N_itNR +N_itTL

Algorithm 4

N(2log₂N + 1) + 3N_b + N_p(N_{itT L}(N_{itT L} + 1) + 3) + 3N_itNR

3 N {log}_{2} (N) + 6 N_{b} + N_{p}^{2} + N_{p} (2 (N_{itTL} - 1) + N_{itNR} + 1) + N_{itNR}