Re: [oc] Again! modulo arithmetic hardware

[John Sheahan <jrsheahan@optushome.com.au>]

that would only be random if 16 states were required.
(withouth the bcd map) 
if 9 states are required, the mapping needs to 
distribute evenly, so a much larger selection is necessary.

of course the prbs could be running continuously, so the pipeline 
delay is irrelevant, just the logic area.

perhaps a 'better' prbs polynomial can be chosen, with period 
a big multiple of 9?

can you define 'between' here. Is it inclusive?
john


On Sat, Mar 09, 2002 at 12:01:04AM -0800, Ali Mashtizadeh wrote:
> Why don't you just convert 4 of the bits into bcd with a simple look up
> table or logic?
> 
> Ali
> 
> jae lim wrote:
> > 
> > Hello everyone
> > 
> > Thank you for your reply.
> > 
> > I am trying to generate a random number that is
> > between [0, 9), let us say R. Frist I use LFSR to
> > generate a number that is between [0,64), let say L,
> > and then doing modulo arithmetic in forms of R mod L
> > in order to make the the real random number that I
> > want locating between [0, 9). This random number is
> > used in the arbiter, so I want to make it take as less
> > clock cycle as possible. Do you guys have any idea how
> > to implement it?
> > 
> > Thank you very much!!
> > 
> > Jay
> > 
> > __________________________________________________
> > Do You Yahoo!?
> > Try FREE Yahoo! Mail - the world's greatest free email!
> > http://mail.yahoo.com/
> > 
> > --
> > To unsubscribe from cores mailing list please visit http://www.opencores.org/mailinglists.shtml
> 
> --
> To unsubscribe from cores mailing list please visit http://www.opencores.org/mailinglists.shtml

--
To unsubscribe from cores mailing list please visit http://www.opencores.org/mailinglists.shtml