Question

What is the number of computations proportional to, in Levinson-Durbin algorithm?

(a) M

(b) M^2

(c) M^3

(d) M^1/2

I got this question by my college professor while I was bunking the class.

I'd like to ask this question from FIR Least Squares Inverse Filters topic in chapter Digital Filters Design of Digital Signal Processing

Answer 1

The correct option is (b) M^2

The best I can explain: The Levinson-Durbin algorithm is the algorithm which is used for the efficient inversion of Toeplitz matrix which requires a number of computations proportional to M^2 instead of the usual M^3.