最小二乘辨识算法中伪随机码最大长度N_p的选择

Selecting Np in Least Square Algorithm

本文论证了最小二乘辨识算法中伪随机码最大长度H_p的选择下限。解决这个问题对指导辨识和参数估计工作很有意义。仿真结果进一步说明本文给出的结论的正确性。

This paper has discussed selecting Np-the shonest periodic pseudo-random sequence in Least Square Algorithm for linear system parameter estimation. To solve the problem has great meaning in directing system identification and parameter estimation. The computer simulation results show the correctness of the conclution in this paper in addition.