Project Advanced Logic Design 2013
Your task is to find 10 n-bit NLFSRs with the period 2n−1 for each n in the range from 26 to 32. Your final result will be a table listing the feedback functions of the resulting NLFSRs. It is compulsory that the feedback functions are represented in
the Reed-Muller canonical form.
Go to this link to read about NLFSRs with the period 2n−1
and see examples for n < 26.
You can search for solutions in several different ways.
One possibility is generate a random function of n variables and then to
simulate the resulting NLFSR to see if its period is 2n−1 or not.
You can use the program which I emailed you as a base.
In general, you can search for any 10 functions for a given n.
However, if you can find functions whose Reed-Muller expressions
are small, it will be an additional advantage. Therefore,
try to organize your search so that it starts from simple expressions
and incrementally increases their complexity. For any given n, stop your search
as soon as you find 10 functions which result is n-bit NLFSRs with the period 2n−1.
The deadline for your project is January 31st, 2013. Please, email me your source
code and your report (3-5 pages, pdf). In the report, include a
description of your search process (how did you searched for functions,
which techniques worked and which did not, etc).