Re: Division by rotation on 8 bit machine
- From: Jonathan Kirwan <jkirwan@xxxxxxxxxxxxxx>
- Date: Thu, 23 Jun 2005 18:34:35 GMT
On Thu, 23 Jun 2005 12:56:16 +0200, "Mehta Shailendrakumar"
<shailendrakumar.mehta@xxxxxxxxxxxx> wrote:
>I am trying to perform 32 bit by 16 bit division on X51 based 8 bit
>controller.
I can tell you how, but I don't have a routine for the 8051 family
written already.
>The result can be limited to 16 bits.
Meaning, I assume:
32-bit
------ = 16-bit quotient
16-bit
So it is okay to completely throw away the remainder portion and, if
the quotient would be larger than 16-bits then the returned value is
allowed to be garbage? You will do your own verification that the
result will fit in 16 bits? And all the values are to be treated as
unsigned?
>I want algorithm for division by rotation which gets executed faster.
Faster than what? You already *have* code for this, aren't disclosing
all the details about it (including its execution time in clocks), and
are asking a clairvoyant to figure out a _faster_ one for you?
How about you provide some exact, specific details about your
situation?
>Please send the idea or algorithm to do it.
After you expose the details of your situation, perhaps.
Jon
.
- Follow-Ups:
- Re: Division by rotation on 8 bit machine
- From: Mehta Shailendrakumar
- Re: Division by rotation on 8 bit machine
- References:
- Division by rotation on 8 bit machine
- From: Mehta Shailendrakumar
- Division by rotation on 8 bit machine
- Prev by Date: Re: MISRA new rule suggestion
- Next by Date: Re: MISRA new rule suggestion
- Previous by thread: Re: Division by rotation on 8 bit machine
- Next by thread: Re: Division by rotation on 8 bit machine
- Index(es):
Relevant Pages
|