32. Fast Finite Field Hartley Transforms based on Hadamard Decomposition

A new transform over finite fields, the Finite Field Hartley Transform FFHT
was recently introduced and a number of promising applications on the
design of efficient multiple access systems and multilevel spread spectrum
sequences were proposed. The FFHT exhibits interesting symmetries,
which are exploited to derive new Fast Transform algorithms (FT).
These FTs are based on successive decompositions of the FFHT by means of
Hadamard-Walsh transforms. This new approach meets the lower bound on
the multiplicative complexity for all the cases investigated so far.
The complexity of these new FTs is compared with that of some classical algorithms.