<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the Matrix Form of the Quaternion Fourier Transform and Quaternion Convolution · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2307.01836/</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/2307.01836/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the Matrix Form of the Quaternion Fourier Transform and Quaternion Convolution — mentioned by teleforce</title><link>https://news.ycombinator.com/item?id=40842708</link><guid isPermaLink="false">urn:hackerpapers:mention:2307.01836:40842708</guid><pubDate>Mon, 01 Jul 2024 05:12:46 GMT</pubDate><description>&lt;p&gt;It will be great if we can minimize the multiplication errors and perhaps do away with the errors altogether by utilizing quaternion based operations describes in the OP article [1],[2],[3]. [1] One-Dimensional Quaternion Discrete Fourier Transform and an Approach to Its Fast Computation: https://www.mdpi.com/2079-9292/12/24/4974 [2] Convolution Theorems for Quaternion Fourier Transform: Properties and Applications: https://onlinelibrary.wiley.com/doi/10.1155/2013/162769 [3] On the Matrix Form of the Quaternion Fourier Transform and Quaternion Convolution: https://arxiv.org/abs/2307.01836&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2307.01836/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
