Error-free identification using maximally orthogonal p.r.b.n. sequences

Crosscorrelation using pseudorandom binary noise as the test signal is a well established technique for the identification of linear systems, but there are several practical difficulties. We show that two of these difficulties, namely the necessity to have fast clock rates and a long p.r.b.n. period can be eliminated by using interclock sampling and by analytically removing folding errors. Further, if a maximally orthogonal test sequence is used, bias or ripple difficulties are overcome, and the analysis is particularly simple and practically tractable.