| ??? 04/19/05 08:07 Read: times |
#91902 - Non-iterative Division Responding to: ???'s previous message |
There is a fast, non-iterative division algorithm for 16-bit values divided by 1 to 16 inclusive - fast_int_divide() - it can be found here:
http://www.programmersheaven.com/zone5/cat.../32144.htm You can divide a 16-bit value by larger divisors by factoring the divisor and making multiple calls to fast_int_divide(). If you are using Keil C51, you should find that the int division algorithm is already well optimised, it treats division by a value less than 256 as a special case. |
| Topic | Author | Date |
| 16bit by 8bit divide | 01/01/70 00:00 | |
| Check This! | 01/01/70 00:00 | |
| And This: | 01/01/70 00:00 | |
| 16bit by 8bit divide | 01/01/70 00:00 | |
| Re: | 01/01/70 00:00 | |
| 16bit by 8bit divide | 01/01/70 00:00 | |
| To Thelam: | 01/01/70 00:00 | |
| well, if you look a bit to the left | 01/01/70 00:00 | |
| 16bit by 8bit divide | 01/01/70 00:00 | |
| Its just ben done | 01/01/70 00:00 | |
| Non-iterative Division | 01/01/70 00:00 | |
| Accuracy | 01/01/70 00:00 | |
| No wonder | 01/01/70 00:00 | |
| again and again | 01/01/70 00:00 | |
| Efficient Division | 01/01/70 00:00 | |
| the divide may ne the tip of the iceberg | 01/01/70 00:00 | |
| 16bit by 8bit divide | 01/01/70 00:00 | |
| the Titanic hit the iceberg | 01/01/70 00:00 | |
| 16bit by 8bit divide | 01/01/70 00:00 | |
Don't know if it helps. | 01/01/70 00:00 |