Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
The problem of finding the complexity of the nonlinear feedforward sequences has been analysed and a unified method has been developed for finding the complexity of such sequences for the cases when feedback is (i) an irreducible polynomial; (ii) product of two irreducible polynomials; (iii) power of an irreducible polynomial. The method is based on the minimum polynomial of the compound matrix formed from the companion matrix of the feedback polynomial. Apart from being a unified method, this approach has the advantage that it can be applied to any level of logic and one can get the minimal generator of all possible nonlinear feedforward sequences.
scientific article; zbMATH DE number 3930898