<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic whole number (integer) power in Intel® Integrated Performance Primitives</title>
    <link>https://community.intel.com/t5/Intel-Integrated-Performance/whole-number-integer-power/m-p/823497#M5003</link>
    <description>For small whole number (integer) constant powers, is it better to iteratively multiply into a temporary buffer, or use Powx?&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;What is the tradeoff in performance vs. precision for each approach (recognizing Powx provides optional precisions)?&lt;/DIV&gt;&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;Thanks!&lt;/DIV&gt;</description>
    <pubDate>Thu, 12 May 2011 22:31:57 GMT</pubDate>
    <dc:creator>jeffc111</dc:creator>
    <dc:date>2011-05-12T22:31:57Z</dc:date>
    <item>
      <title>whole number (integer) power</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/whole-number-integer-power/m-p/823497#M5003</link>
      <description>For small whole number (integer) constant powers, is it better to iteratively multiply into a temporary buffer, or use Powx?&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;What is the tradeoff in performance vs. precision for each approach (recognizing Powx provides optional precisions)?&lt;/DIV&gt;&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;Thanks!&lt;/DIV&gt;</description>
      <pubDate>Thu, 12 May 2011 22:31:57 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/whole-number-integer-power/m-p/823497#M5003</guid>
      <dc:creator>jeffc111</dc:creator>
      <dc:date>2011-05-12T22:31:57Z</dc:date>
    </item>
    <item>
      <title>whole number (integer) power</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/whole-number-integer-power/m-p/823498#M5004</link>
      <description>&lt;P&gt;Hi, &lt;/P&gt;&lt;P&gt;I think simple iterative multiplication will have a better performance and good precision with small power N. You might just have a simple test with the following two ways, and see which one is better for your data: &lt;/P&gt;&lt;P&gt;ippsPowx_32f_A21( indata, N, ouputdata, length );&lt;/P&gt;&lt;P&gt;or: &lt;/P&gt;&lt;P&gt;for(int j=0;j&lt;N&gt;&lt;/N&gt;&lt;/P&gt;&lt;P&gt;ippsMul_32f_I(outputdata, indata,length);&lt;/P&gt;&lt;P&gt;}&lt;/P&gt;&lt;P&gt;Thanks,&lt;BR /&gt;Chao&lt;/P&gt;</description>
      <pubDate>Mon, 16 May 2011 07:44:32 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/whole-number-integer-power/m-p/823498#M5004</guid>
      <dc:creator>Chao_Y_Intel</dc:creator>
      <dc:date>2011-05-16T07:44:32Z</dc:date>
    </item>
  </channel>
</rss>

