Re: 68K/68332 Assembly/Binary Problem
- From: "ronivek" <kevinor@xxxxxxxxx>
- Date: 30 Mar 2007 18:52:26 -0700
On Mar 31, 2:15 am, Robert Redelmeier <red...@xxxxxxxxxxxxxxx> wrote:
kevi...@xxxxxxxxx wrote in part:
I just coded a LUT generation subroutine and it took <10000
cycles up to 10^20; I guess that bodes well enough for the
conversion algorithms if I can get them done and working.
500 clk/decimal digit isn't very fast. DIV may be faster!
I'd expect a LUT to be <50, possibly <20.
-- Robert
Well that's just the initial generation subroutine;
Currently I have a full 64-bit integer read from the Terminal;
converted into binary and then converted back into a String and
printed in 24k cycles. That's including the LUT generation which only
happens once per program initialisation. Ignoring the initial table
generation and the I/O it's about 10k for all the conversions.
In what sort of implementation do you think DIV would be faster?
.
- References:
- 68K/68332 Assembly/Binary Problem
- From: kevinor
- Re: 68K/68332 Assembly/Binary Problem
- From: Robert Redelmeier
- Re: 68K/68332 Assembly/Binary Problem
- From: kevinor
- Re: 68K/68332 Assembly/Binary Problem
- From: Robert Redelmeier
- Re: 68K/68332 Assembly/Binary Problem
- From: kevinor
- Re: 68K/68332 Assembly/Binary Problem
- From: Robert Redelmeier
- Re: 68K/68332 Assembly/Binary Problem
- From: kevinor
- Re: 68K/68332 Assembly/Binary Problem
- From: Robert Redelmeier
- 68K/68332 Assembly/Binary Problem
- Prev by Date: Re: newbie: MUL product
- Next by Date: Re: cFASM (calling FASM as a C function)
- Previous by thread: Re: 68K/68332 Assembly/Binary Problem
- Next by thread: Re: 68K/68332 Assembly/Binary Problem
- Index(es):
Relevant Pages
|