Re: 68K/68332 Assembly/Binary Problem
- From: "Wolfgang Kern" <nowhere@xxxxxxxx>
- Date: Sat, 31 Mar 2007 02:12:19 +0200
kevinor asked:
My current train of thought is to code a number of Bin/Hex conversions
with relatively low cycle-counts.
In order to perform the Decimal conversions the best I can come up
with at the moment is to have a place-value table of powers of ten and
use indexing and addition algorithms to compute the place-values
during conversions. It will take a large number of cycles but it's the
best I can come up with at the moment. Is this a valid approach do you
think?
Yes indeed, it's fast but needs a prepared table in memory.
I have this table in memory all the time as it can also
help fast LUT divide (hugh figures) and quick LOG2(10)/LOG10(2)
conversion tasks.
Beside that your target (Motorola) CPU may use Big Endian storage,
You esay could follow my way with the (partial LOG)-LUT
I mentioned already in another thread within this week, within this NG.
__
wolfgang
.
- Follow-Ups:
- Re: 68K/68332 Assembly/Binary Problem
- From: kevinor
- Re: 68K/68332 Assembly/Binary Problem
- 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
- 68K/68332 Assembly/Binary Problem
- Prev by Date: Re: How send character to keyboardbuffer?
- Next by Date: Re: 68K/68332 Assembly/Binary Problem
- Previous by thread: Re: 68K/68332 Assembly/Binary Problem
- Next by thread: Re: 68K/68332 Assembly/Binary Problem
- Index(es):
Relevant Pages
|