Ben Laurie (ben@algroup.co.uk)
Tue, 07 Jul 1998 10:15:38 +0100
Antonomasia wrote:
> I wouldn't like to run this more economically than 1 bit per 2 hits.
> The reason is that a particularly long/short interval is likely to be
> longer/shorter than both the neighbours, leading to correlation.
That can only happen if you reuse timing intervals, which wouldn't be a
good idea.
> > Hmmm ... I can see that this train of thought is going to lead to
> > someone demanding that I back it up with some maths, so perhaps I'd
> > better shut up.
>
> I think I remember the standard deviation of the decay rate being
> the square root of the decay rate. All this derived from single
> atoms having the same probability of decay in a given time.
> If you used the count rate to feed your program and it had say
> 100 counts per second (sd=10 c/s) then you'd be using 100 counts
> to get several bits [maths omitted], but I think the bits per count
> would be lower than the method you are already considering.
I was suggesting using the length of the intervals to generate more
bits, rather than the count in a specified time.
Cheers,
Ben.
-- Ben Laurie |Phone: +44 (181) 735 0686| Apache Group member Freelance Consultant |Fax: +44 (181) 735 0689|http://www.apache.org/ and Technical Director|Email: ben@algroup.co.uk | A.L. Digital Ltd, |Apache-SSL author http://www.apache-ssl.org/ London, England. |"Apache: TDG" http://www.ora.com/catalog/apache/WE'RE RECRUITING! http://www.aldigital.co.uk/recruit/
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:20:08 ADT