Table 1.

Comparison of computational complexity in FLOPS on (i) inverse kepstrum processing, (ii) kepstrum processing and (iii) NLMS algorithm [20].

Algorithm	Required processing	FLOPS
(i) Inverse kepstrum	1 × WOSA Periodogram 4 × FFT / IFFT 2 × Logarithm /Exponential	IN log2(5.12 / Δf) 4(N / 2)log2N 2N1/3(log N)2
	Total Computation (*)	0.057 × 106
(ii) Kepstrum	2 × WOSA Periodogram 5 × FFT / IFFT 3 × Logarithm/Exponential	2N log2(5.12 / Δf) 5(N / 2)log2N 3N1/3(log N)2
	Total Computation (*)	0.08 × 106
(iii) NLMS	Real multiplication (A) Iterations (B)	3N2 + 2N 20 × (A)
	Total Computation (**)	(A) 0.12 × 106 (B) 2.4 × 106

Note: Total computation:

(*) is based on N: 2048 frame size,

(**) is based on 200 NLMS weights.