<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algebraic Signal Processing Theory · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0612077/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0612077/feed.xml" rel="self" type="application/rss+xml" /><item><title>Algebraic Signal Processing Theory — mentioned by jacobolus</title><link>https://news.ycombinator.com/item?id=15092924</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0612077:15092924</guid><pubDate>Thu, 24 Aug 2017 18:55:46 GMT</pubDate><description>&lt;p&gt;Apparently this FFT was first discovered by Gauss (1805). http://www.cis.rit.edu/class/simg716/Gauss_History_FFT.pdf As a follow-up, let me recommend Püschel &amp;amp; Moura (2006) “Algebraic Signal Processing Theory”, https://arxiv.org/pdf/cs/0612077.pdf and Püschel’s other papers about similar topics. Or in a different direction, DJB (2008), “Fast multiplication and its applications”, http://cr.yp.to/lineartime/multapps-20080515.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0612077/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item></channel></rss>
