Levinson algorithm
Mostrar comentarios más antiguos
The 'n' in levinson algorithm is the order of the all pole filter right?
Say the order is 12. The output 'a' should have only 12 elements as the output right? why do I get 13 elements? Is my understanding wrong... Please help
Respuestas (1)
Honglei Chen
el 13 de Abr. de 2012
0 votos
Hi Shweta,
It is true that the algorithm only solves n unknowns, but if you look at the reference page below, the returned result is the AR coefficients which always include the leading coefficient of 1, therefore the total length is n+1.
HTH
Categorías
Más información sobre Linear Algebra en Centro de ayuda y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!