Re: Any progress yet? (was Re: Fast pi program?)
- From: CBFalconer <cbfalconer@xxxxxxxxx>
- Date: Fri, 31 Aug 2007 05:35:13 -0400
mike3 wrote:
.... snip ...
It does calculate in base 26^4. You are right. To compute in base 10
you need to compute 2x the digits then convert to 26 (since the
algorithms work best with powers of 2 numeric sizes), which
effectively cancels much of the speed gain. Plus that final
radix conversion is _not_ cheap, you know.
Read dubldabl.txt, for a way to convert binary to bcd quickly. See:
<http://cbfalconer.home.att.net/download/>
--
Chuck F (cbfalconer at maineline dot net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net>
--
Posted via a free Usenet account from http://www.teranews.com
.
- References:
- Fast pi program?
- From: mike3
- Any progress yet? (was Re: Fast pi program?)
- From: mike3
- Re: Any progress yet? (was Re: Fast pi program?)
- From: Alf P. Steinbach
- Re: Any progress yet? (was Re: Fast pi program?)
- From: mike3
- Re: Any progress yet? (was Re: Fast pi program?)
- From: Alf P. Steinbach
- Re: Any progress yet? (was Re: Fast pi program?)
- From: mike3
- Fast pi program?
- Prev by Date: Re: Efficient interval representation
- Next by Date: Re: Coding Standards
- Previous by thread: Re: Any progress yet? (was Re: Fast pi program?)
- Next by thread: Quick HyperTerminal Query
- Index(es):
Relevant Pages
|