Skip to main content
EURASIP Journal on Advances in Signal Processing

Table 1 Analysis results of algorithm complexity

From: A modified asynchronous sequential Kalman track fusion based on sound propagation time

 

AS-KF-ESV (5 m)

AS-KF-ESV (10 m)

AS-KF-ESV (15 m)

AS-KF

Running time

654.184 s

654.232 s

653.793 s

604.566 s

memory footprint

68.7 M

17.3 M

8.97 M

1.40 M

Back to article page