| | Automatic Generation of Transform Algorithms |
 | | The approach extends the well known concept of discrete Fourier transforms over finite groups and became feasible through two advances: A method to decompose monomial representations of solvable groups by structural recursion and a method to compute certain symmetries of matrices by combinatorial search. |
 | | The methods have been implemented in the library AREP and used to generate fast algorithms for a class of transforms including the discrete Fourier, cosine, sine, and Hartley transform, automatically. |
 | | We present an efficient algorithm which decomposes a monomial representation of a solvable group G into its irreducible components. |
| www.ece.cmu.edu /~smart/papers/autgen.html (865 words) |