A new algorithm of deriving linear combination for delayed m-sequence

The traditional algorithm for solving the linear combination of delayed m-sequence is discussed. Based on analysis of the linear relationship between the states of the central m-sequence and the delayed m-sequence, a new algorithm, which solves the linear combination problem of delayed m-sequence, is given by taking advantage of linear equations over binary finite field. Application of this algorithm on designing the mask of the N-CDMA mobile communication system is discussed. This algorithm provides a convenient way for the generation of long delayed m-sequence in the engineering calculation.