"Random" Circuit Needed.

There is that: there are only three linear boolean operators, NOT, XOR,XNOR, (and they can all be derived from XOR )

That would make it a non-linear FSR

The key word there is "something". Technically once you make this mod it is not an LFSR anymore. But that is what the OP wants, something that is *not* an LFSR because the LFSR only covers 2^N-1 states and he wants 2^N.

A rose by any other name....

Maximum length sequences of even order are perfectly possible, but they require more feedback taps.

Cheers

Phil Hobbs

Jim do you have a model of a 7483?

--- And, as such, your narcissistic off-topic garbage has no proper place here.

---

--- Some of us have progressed past the soldering iron stage and have come to understand our own and others' personality defects, are working on them, and aren't afraid to talk about them.

Some of us haven't.

---

--- And/Or acquiesce to the showers as your final solution?

---

--- Wow. Sounds like you're drawing a line in the sand with you on one side and Bill and I on the other.

Why would you do that?

---

--- You're excused; go do it.

John Fields

Now that's really sad. What do you do all day, argue and whine on newsgroups?

I'm collected some parts and am headed for the Metcal. Whine on!

Pot, meet kettle...

Funny how disdain for insults pours out of one side of your mouth, while insults pour out of the other.

John Fields

It's a typo (or a fence-post error).

this is the arithmetic in c:

// a=a % 65537 in c:

a = a & 0xffff - ( a & ~ 0xffff ) >> 16; a = a

Its an abortive mistake.

It should be mod 2^n i.e. 65536. or 256 or 16 etc

also you don't use a rotation just a left shift. Each left shift by 1 bit works like a multiply *2 and you don't need to track the carry outs or MSB's of the shifted number the mod function throws them away anyway.

So to use an adder to multiply by say 5 you have the input number feed into one input of the adder shifted left by 2 bits - that is 4 x the input number. Into the other input of the adder you input the original seed - so

Last if you use the carry in of the least significant adder as a + 1 function then a simple LCG takes one adder only (excluding latches you might need to avoid race issues)

Sno-o-o-ort! >:-} ...Jim Thompson

Cool. Tell us about what you're working on.

A new 555 circuit.

Is that possible?

I discovered it when I was ih highschool, it's not that different to the trick to compute y=x%11 in base 10 only it's done in base 65536 and only does two digits.