<?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: Public Domain Fourier Transform Library for Common Lisp</title>
	<atom:link href="http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/feed/" rel="self" type="application/rss+xml" />
	<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/</link>
	<description>software development and consulting</description>
	<lastBuildDate>Sun, 20 May 2012 18:07:58 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: pat</title>
		<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/comment-page-1/#comment-373</link>
		<dc:creator>pat</dc:creator>
		<pubDate>Thu, 08 Oct 2009 14:18:20 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=941#comment-373</guid>
		<description>I never got FFTW working on my Mac.  I may play with it some more to try to get a better idea of the speed comparison.

That said, it looks like I lose terribly to &lt;a href=&quot;http://vintage-digital.com/hefner/software/bordeaux-fft/manual.html&quot; rel=&quot;nofollow&quot;&gt;Bordeaux-FFT&lt;/a&gt; though.  It only handles one-dimensional arrays, but I should probably look to it for some guidance about how to make this really sing.  For a 1,048,576 sample array, my FFT takes 4.92 seconds while the Bordeaux-FFT library takes 0.72 seconds.</description>
		<content:encoded><![CDATA[<p>I never got FFTW working on my Mac.  I may play with it some more to try to get a better idea of the speed comparison.</p>
<p>That said, it looks like I lose terribly to <a href="http://vintage-digital.com/hefner/software/bordeaux-fft/manual.html" rel="nofollow">Bordeaux-FFT</a> though.  It only handles one-dimensional arrays, but I should probably look to it for some guidance about how to make this really sing.  For a 1,048,576 sample array, my FFT takes 4.92 seconds while the Bordeaux-FFT library takes 0.72 seconds.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pat</title>
		<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/comment-page-1/#comment-369</link>
		<dc:creator>pat</dc:creator>
		<pubDate>Thu, 08 Oct 2009 12:44:30 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=941#comment-369</guid>
		<description>No, I didn&#039;t.  Another person pointed it out in &lt;a href=&quot;http://nklein.com/2009/10/lisp-troubles-fabricating-a-closure/#comments&quot; rel=&quot;nofollow&quot;&gt;this thread&lt;/a&gt;.  I don&#039;t know how I missed it when I was searching Google for FFT and Lisp because it comes up in the top ten hits.  All I found before is FFTW bindings.  Also, Bordeaux FFT isn&#039;t mentioned on the Cliki, nor is it hosted on common-lisp.net like Bordeaux Threads is.

I will get Bordeaux FFT on the Cliki and on my page.  Thanks for the heads up.</description>
		<content:encoded><![CDATA[<p>No, I didn&#8217;t.  Another person pointed it out in <a href="http://nklein.com/2009/10/lisp-troubles-fabricating-a-closure/#comments" rel="nofollow">this thread</a>.  I don&#8217;t know how I missed it when I was searching Google for FFT and Lisp because it comes up in the top ten hits.  All I found before is FFTW bindings.  Also, Bordeaux FFT isn&#8217;t mentioned on the Cliki, nor is it hosted on common-lisp.net like Bordeaux Threads is.</p>
<p>I will get Bordeaux FFT on the Cliki and on my page.  Thanks for the heads up.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: stassats</title>
		<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/comment-page-1/#comment-366</link>
		<dc:creator>stassats</dc:creator>
		<pubDate>Thu, 08 Oct 2009 12:15:45 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=941#comment-366</guid>
		<description>Did you know about http://vintage-digital.com/hefner/software/bordeaux-fft/manual.html ?</description>
		<content:encoded><![CDATA[<p>Did you know about <a href="http://vintage-digital.com/hefner/software/bordeaux-fft/manual.html" rel="nofollow">http://vintage-digital.com/hefner/software/bordeaux-fft/manual.html</a> ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Leslie P. Polzer</title>
		<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/comment-page-1/#comment-364</link>
		<dc:creator>Leslie P. Polzer</dc:creator>
		<pubDate>Thu, 08 Oct 2009 07:23:56 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=941#comment-364</guid>
		<description>Have you done any benchmarks against FFTW? I&#039;d be interested in the results, even with an unoptimized version of CL-FFT.</description>
		<content:encoded><![CDATA[<p>Have you done any benchmarks against FFTW? I&#8217;d be interested in the results, even with an unoptimized version of CL-FFT.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pat</title>
		<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/comment-page-1/#comment-361</link>
		<dc:creator>pat</dc:creator>
		<pubDate>Thu, 08 Oct 2009 03:07:09 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=941#comment-361</guid>
		<description>I know all about DCTs.  A few jobs ago, I did image-processing with a bent toward &quot;what can we do with JPEG images without inverse DCT-ing them&quot;.  You&#039;re missing a word in your last sentence there though... was that &quot;you&#039;ll see that you didn&#039;t lose much information anyways&quot; or what?

Anyhow... DCTs have much of the same stricture as DFTs did.... they are much happier with axis-aligned modulations that are at a frequency that&#039;s a power-of-two divided by the image size.  For other things, they really spread around the power more than I was hoping my GA would.</description>
		<content:encoded><![CDATA[<p>I know all about DCTs.  A few jobs ago, I did image-processing with a bent toward &#8220;what can we do with JPEG images without inverse DCT-ing them&#8221;.  You&#8217;re missing a word in your last sentence there though&#8230; was that &#8220;you&#8217;ll see that you didn&#8217;t lose much information anyways&#8221; or what?</p>
<p>Anyhow&#8230; DCTs have much of the same stricture as DFTs did&#8230;. they are much happier with axis-aligned modulations that are at a frequency that&#8217;s a power-of-two divided by the image size.  For other things, they really spread around the power more than I was hoping my GA would.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reddit sux</title>
		<link>http://nklein.com/2009/10/public-domain-fourier-transform-library-for-common-lisp/comment-page-1/#comment-360</link>
		<dc:creator>Reddit sux</dc:creator>
		<pubDate>Thu, 08 Oct 2009 00:03:05 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=941#comment-360</guid>
		<description>In typical reddit manner they are wrong. You should&#039;ve done the DCT.

Go look at how jpegs are compressed and you&#039;ll see that you didn&#039;t much information anyways.</description>
		<content:encoded><![CDATA[<p>In typical reddit manner they are wrong. You should&#8217;ve done the DCT.</p>
<p>Go look at how jpegs are compressed and you&#8217;ll see that you didn&#8217;t much information anyways.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

