DocumentCode :
37082
Title :
A Scalable Method for Constructing Galois NLFSRs With Period 2^n-1 Using Cross-Join Pairs
Author :
Dubrova, Elena
Author_Institution :
R. Inst. of Technol. (KTH), Stockholm, Sweden
Volume :
59
Issue :
1
fYear :
2013
fDate :
Jan. 2013
Firstpage :
703
Lastpage :
709
Abstract :
A method for constructing n-stage Galois NLFSRs with period 2n-1 from n-stage maximum length LFSRs is presented. Nonlinearity is introduced into state cycles by adding a nonlinear Boolean function to the feedback polynomial of the LFSR. Each assignment of variables for which this function evaluates to 1 acts as a crossing point for the LFSR state cycle. The effect of nonlinearity is cancelled and state cycles are joined back by adding a copy of the same function to a later stage of the register. The presented method requires no extra time steps and it has a smaller area overhead compared to the previous approaches based on cross-join pairs. It is feasible for large n.
Keywords :
Boolean functions; Galois fields; feedback; polynomials; shift registers; LFSR state cycle; area overhead; cross-join pairs; crossing point; feedback polynomial; n-stage Galois NLFSR; n-stage maximum length LFSR; nonlinear Boolean function; nonlinearity effect; state cycles; Boolean functions; Generators; Indexes; Logic gates; Polynomials; Shift registers; LFSR; NLFSR; cross-join pairs; de Bruijn sequence; maximum length sequence; pseudo-random sequence;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2012.2214204
Filename :
6290394
Link To Document :
بازگشت