You are not logged in.
#1 2012-09-18 20:35:23
- monisha
- Guest
verilog program for primitive polynomial search
hi friends...........does anyone here have a clear idea of verilog..so that the program for primitive polynomial search can be explained?
#2 2012-09-18 20:45:27
- bobbym
- Administrator
Offline
Re: verilog program for primitive polynomial search
Hi;
Welcome to the forum. I have never heard of it. What is it?
In mathematics, you don't understand things. You just get used to them.
90% of mathematicians do not understand 90% of currently published mathematics.
I am willing to wager that over 75% of the new words that appeared were nothing more than spelling errors that caught on.
#3 2012-09-26 12:08:53
- monisha
- Guest
Re: verilog program for primitive polynomial search
Initially a random matrix is to be formed(with ones < or = the no of xor gates based on the architecture in my project)eg. if xor gates=3 only 3 ones or 3-1 ones in matrix.
The problem is as far as I have referred matrix forms cant be used in verilog.The next step is to find det(mat)=0 ;else repeat to step 1.
Then determine the characteristic polynomial of the matrix.Check if its reducible else go to step1.
Finally perform the full primitive test . Can u help me with this?
#4 2012-09-26 13:02:17
- bobbym
- Administrator
Offline
Re: verilog program for primitive polynomial search
Hi;
I still do not know what verilog is. Can you tell me?
In mathematics, you don't understand things. You just get used to them.
90% of mathematicians do not understand 90% of currently published mathematics.
I am willing to wager that over 75% of the new words that appeared were nothing more than spelling errors that caught on.
#5 2012-09-26 16:49:41
- bob bundy
- Moderator
Offline
Re: verilog program for primitive polynomial search
You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei