Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: √ ∞ ≠ ≤ ≥ ≈ ⇒ ∈ Δ θ ∴ ∑ ∫ π -

Login

Username

Password

Not registered yet?

  • Index
  •  » Guestbook
  •  » verilog program for primitive polynomial search

Post a reply

Go back

Write your message and submit
:) :| :( :D :o ;) :/ :P :lol: :mad: :rolleyes: :cool: | :dizzy :eek :kiss :roflol :rolleyes :shame :down :up :touched :sleep :wave :swear :tongue :what :faint :dunno
Options

Go back

Topic review (newest first)

bob bundy
2012-09-26 16:49:41
bobbym
2012-09-26 13:02:17

Hi;

I still do not know what verilog is. Can you tell me?

monisha
2012-09-26 12:08:53

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?

bobbym
2012-09-18 20:45:27

Hi;

Welcome to the forum. I have never heard of it. What is it?

monisha
2012-09-18 20:35:23

hi friends...........does anyone here have a clear idea of verilog..so that the program for primitive polynomial search can be explained?

Board footer

Powered by FluxBB