A comparison of two Hammerstein model identification algorithms

Two algorithms for least-squares estimation of parameters of a Hammerstein model are compared. Numerical examples demonstrate that the iterative method of Narendra and Gallman produces significantly smaller parameter covariance and slightly smaller rms error than the noniterative method of Chang and Luus, as expected from an analysis of the parameter estimators. In addition, the iterative algorithm is faster for high-order systems.