<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Division of integers by constants</title>
	<atom:link href="http://embeddedgurus.com/stack-overflow/2009/06/division-of-integers-by-constants/feed/" rel="self" type="application/rss+xml" />
	<link>http://embeddedgurus.com/stack-overflow/2009/06/division-of-integers-by-constants/</link>
	<description>Thoughts on embedded systems by Nigel Jones</description>
	<lastBuildDate>Wed, 28 Jul 2010 00:59:13 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: victorh</title>
		<link>http://embeddedgurus.com/stack-overflow/2009/06/division-of-integers-by-constants/comment-page-1/#comment-234</link>
		<dc:creator>victorh</dc:creator>
		<pubDate>Wed, 17 Jun 2009 19:44:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.gfcdev.org/test-stack/2009/06/05/division-of-integers-by-constants/#comment-234</guid>
		<description>Hello Nigel!In order to give you the exact figures, I have to undust my code. But I can tell you from the top of my head that the reciprocal multiplication is more than 10 times faster than the naive ones (i.e. sprintf and built-in division by 10)All the approaches were implemented in C, using HI-TECH PICC standard (not PRO) compiler.By the way, just yesterday Embedded.com published a nice article about this very same topic. Check it out.http://www.embedded.com/217900224?printable=true</description>
		<content:encoded><![CDATA[<p>Hello Nigel!In order to give you the exact figures, I have to undust my code. But I can tell you from the top of my head that the reciprocal multiplication is more than 10 times faster than the naive ones (i.e. sprintf and built-in division by 10)All the approaches were implemented in C, using HI-TECH PICC standard (not PRO) compiler.By the way, just yesterday Embedded.com published a nice article about this very same topic. Check it out.http://www.embedded.com/217900224?printable=true</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nigel Jones</title>
		<link>http://embeddedgurus.com/stack-overflow/2009/06/division-of-integers-by-constants/comment-page-1/#comment-233</link>
		<dc:creator>Nigel Jones</dc:creator>
		<pubDate>Wed, 10 Jun 2009 11:36:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.gfcdev.org/test-stack/2009/06/05/division-of-integers-by-constants/#comment-233</guid>
		<description>A fellow fan! Did you implement it in assembly language or C? Also what was the magnitude of the variation between the various methods? I ask because I&#039;m intrigued to see how the method ports to other architectures.</description>
		<content:encoded><![CDATA[<p>A fellow fan! Did you implement it in assembly language or C? Also what was the magnitude of the variation between the various methods? I ask because I&#39;m intrigued to see how the method ports to other architectures.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: victorh</title>
		<link>http://embeddedgurus.com/stack-overflow/2009/06/division-of-integers-by-constants/comment-page-1/#comment-232</link>
		<dc:creator>victorh</dc:creator>
		<pubDate>Tue, 09 Jun 2009 20:11:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.gfcdev.org/test-stack/2009/06/05/division-of-integers-by-constants/#comment-232</guid>
		<description>Some time ago, I needed to implement an efficient and effective way (in terms of program size, RAM usage and speed) to convert an uint32_t to a BCD on a PIC16F690. After trying and finetuning such different approaches as the compiler built-in division, sprintf, &lt;a href=&quot;http://forum.htsoft.com/all/showthreaded.php/Cat/0/Number/15168/&quot; rel=&quot;nofollow&quot;&gt;successive subtractions&lt;/a&gt;, and some &lt;a href=&quot;http://www.microchipc.com/sourcecode/PIC_Hi-Tech_C_decimal_output_routines.zip&quot; rel=&quot;nofollow&quot;&gt;faster&lt;/a&gt;-but-&lt;a href=&quot;http://forum.htsoft.com/all/showthreaded.php/Cat/0/Number/13307/&quot; rel=&quot;nofollow&quot;&gt;obscure&lt;/a&gt; algorithms, a reciprocal multiplication implemented with &lt;a href=&quot;http://www.cs.uiowa.edu/~jones/bcd/divide.html#nomul&quot; rel=&quot;nofollow&quot;&gt;shifts and additions&lt;/a&gt; resulted in a non-convoluted method, and the fastest one I benchmarked. Truly, Douglas Jones&#039; paper was a lifesaver for me. Really good stuff.</description>
		<content:encoded><![CDATA[<p>Some time ago, I needed to implement an efficient and effective way (in terms of program size, RAM usage and speed) to convert an uint32_t to a BCD on a PIC16F690. After trying and finetuning such different approaches as the compiler built-in division, sprintf, <a href="http://forum.htsoft.com/all/showthreaded.php/Cat/0/Number/15168/" rel="nofollow">successive subtractions</a>, and some <a href="http://www.microchipc.com/sourcecode/PIC_Hi-Tech_C_decimal_output_routines.zip" rel="nofollow">faster</a>-but-<a href="http://forum.htsoft.com/all/showthreaded.php/Cat/0/Number/13307/" rel="nofollow">obscure</a> algorithms, a reciprocal multiplication implemented with <a href="http://www.cs.uiowa.edu/~jones/bcd/divide.html#nomul" rel="nofollow">shifts and additions</a> resulted in a non-convoluted method, and the fastest one I benchmarked. Truly, Douglas Jones&#39; paper was a lifesaver for me. Really good stuff.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
