Nonlinear identification using inverse-repeatm sequences

A Complete formal solution of the Wiener approximation problem in the absence of noise is given for the case when the input is a ternary or an inverse-repeat binary m sequence. The full set of correlation equations are shown to depend on N/2 1st-order and N/2 2nd-order equations, where N is the sequence period; for the ternary sequence, the proof makes use of a new identity in the elements 0, 1, ¿1. It is concluded that these sequences do not effectively identify kernels of order greater than 2.