On the linear complexity of nonlinearly filtered pn-sequences
Nicholas Kolokotronis, N. Kalouptsidis · IEEE Transactions on Information Theory · 2003
Binary sequences of period 2/sup n/-1 generated by a linear feedback shift register (LFSR) whose stages are filtered by a nonlinear function, f, are studied. New iterative formulas are derived for the calculation of the linear complexity of the output sequences. It is shown that these tools provide an efficient mechanism for controlling the linear complexity of the nonlinearly filtered maximal-length sequences.