
Discrete Hartley Transform
The discrete Hartley transform, DHT, is given by the matrix
The following structured, sparse matrix factorization represents a fast algorithm for a DHT, size 8, and has been automatically generated (even in the presented Latex format) using the package AREP.
Note that this algorithm requires 2 multiplications and 22 additions and is thus among the best ones known.
O.k., you where not looking for math, but hoping to find good code for this (or other) transforms? No problem, get SPIRAL.
