Answers are grounded in this paper and cite their sources.
The extension of the all-pole (AR) exact least-squares ladder algorithms to the pole-zero (ARMA) case is presented. The algorithms are based on a general set of recursions obtained by a geometric approach. The recursions obtained are square-root normalized and have much simpler structures than the unnormalized case. Special cases of white input and unknown input are also discussed.
No takes yet. Share an insight, caveat, or question.
Lee et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: