Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

**monisha****Guest**

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

**bobbym****bumpkin**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 109,606

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.****If it ain't broke, fix it until it is.**** Always satisfy the Prime Directive of getting the right answer above all else.**

Offline

**monisha****Guest**

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****bumpkin**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 109,606

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.****If it ain't broke, fix it until it is.**** Always satisfy the Prime Directive of getting the right answer above all else.**

Offline

**bob bundy****Administrator**- Registered: 2010-06-20
- Posts: 8,075

Children are not defined by school ...........The Fonz

You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei

Offline