<?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>LPCXpresso IDEのトピックRe: LPC4088 N point FFT Problem</title>
    <link>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552512#M12337</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;STRONG&gt;Content originally posted in LPCWare by emh203 on Fri Mar 06 08:47:37 MST 2015&lt;/STRONG&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I think you need to rethink your problem.&amp;nbsp;&amp;nbsp;&amp;nbsp; You cannot do an FFT on a non power of 2 size input buffer.&amp;nbsp;&amp;nbsp;&amp;nbsp; If you absolutely need to do a non power of 2 buffer size,&amp;nbsp;&amp;nbsp; you must use a DFT (which will be very slow).&amp;nbsp;&amp;nbsp; The FFT algorithm is a special case of the DFT for power of 2 size inputs.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;Also,&amp;nbsp;&amp;nbsp; the reason the FFT size is limited to 4096 is that you can always use a decimation in time algorithm to break your input buffer into smaller FFT sizes.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Thu, 16 Jun 2016 02:03:25 GMT</pubDate>
    <dc:creator>lpcware</dc:creator>
    <dc:date>2016-06-16T02:03:25Z</dc:date>
    <item>
      <title>LPC4088 N point FFT Problem</title>
      <link>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552510#M12335</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;STRONG&gt;Content originally posted in LPCWare by maheshg on Sun Jun 15 22:32:34 MST 2014&lt;/STRONG&gt;&lt;BR /&gt;&lt;SPAN&gt;Hi &lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I am working on a project ,in which i need to use FFT on 100000 point of input data .I am using CMSIS_DSPLIB_Latest library&amp;nbsp; but it supports only a maximum of 4096 point FFT .So is there any way to find the N point FFT (Where N is Variable length ).&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;An early response will be appriciated.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;Thanks in advance. &lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 16 Jun 2016 02:03:23 GMT</pubDate>
      <guid>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552510#M12335</guid>
      <dc:creator>lpcware</dc:creator>
      <dc:date>2016-06-16T02:03:23Z</dc:date>
    </item>
    <item>
      <title>Re: LPC4088 N point FFT Problem</title>
      <link>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552511#M12336</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;STRONG&gt;Content originally posted in LPCWare by nerd herd on Fri Mar 06 08:26:00 MST 2015&lt;/STRONG&gt;&lt;BR /&gt;&lt;SPAN&gt;Hi maheshg,&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;If you are asking if NXP has any sort of library or sample code that can do the FFT you are require, then I'm sorry but we do not. Your best bet is to use Google to see if someone has made such a function.&lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 16 Jun 2016 02:03:24 GMT</pubDate>
      <guid>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552511#M12336</guid>
      <dc:creator>lpcware</dc:creator>
      <dc:date>2016-06-16T02:03:24Z</dc:date>
    </item>
    <item>
      <title>Re: LPC4088 N point FFT Problem</title>
      <link>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552512#M12337</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;STRONG&gt;Content originally posted in LPCWare by emh203 on Fri Mar 06 08:47:37 MST 2015&lt;/STRONG&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I think you need to rethink your problem.&amp;nbsp;&amp;nbsp;&amp;nbsp; You cannot do an FFT on a non power of 2 size input buffer.&amp;nbsp;&amp;nbsp;&amp;nbsp; If you absolutely need to do a non power of 2 buffer size,&amp;nbsp;&amp;nbsp; you must use a DFT (which will be very slow).&amp;nbsp;&amp;nbsp; The FFT algorithm is a special case of the DFT for power of 2 size inputs.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;Also,&amp;nbsp;&amp;nbsp; the reason the FFT size is limited to 4096 is that you can always use a decimation in time algorithm to break your input buffer into smaller FFT sizes.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 16 Jun 2016 02:03:25 GMT</pubDate>
      <guid>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552512#M12337</guid>
      <dc:creator>lpcware</dc:creator>
      <dc:date>2016-06-16T02:03:25Z</dc:date>
    </item>
    <item>
      <title>Re: LPC4088 N point FFT Problem</title>
      <link>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552513#M12338</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;STRONG&gt;Content originally posted in LPCWare by starblue on Mon Mar 09 02:40:31 MST 2015&lt;/STRONG&gt;&lt;BR /&gt;&lt;HR /&gt;&lt;SPAN style="color: #0000ff;"&gt;&lt;STRONG&gt;Quote: emh203&lt;/STRONG&gt;&lt;BR /&gt;You cannot do an FFT on a non power of 2 size input buffer.&lt;/SPAN&gt;&lt;HR /&gt;&lt;BR /&gt;&lt;SPAN&gt;That's not quite true, you can use a modified FFT if your input size has only small factors. It is more complicated (e.g. for a factor of five you'll need a 5-fold analogue of the butterfly), and efficiency will get worse the larger the factors become. So it is better to avoid it.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I agree that rethinking the problem in order to avoid an overly large and possibly nonstandard FFT computation is much better.&lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 16 Jun 2016 02:03:25 GMT</pubDate>
      <guid>https://community.nxp.com/t5/LPCXpresso-IDE/LPC4088-N-point-FFT-Problem/m-p/552513#M12338</guid>
      <dc:creator>lpcware</dc:creator>
      <dc:date>2016-06-16T02:03:25Z</dc:date>
    </item>
  </channel>
</rss>

