Hartley transforms over finite fields
A general framework is presented for constructing transforms in the field of the input which have a convolution-like property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is shown that these basefield transforms can be viewed as "projections" of the discrete Fourier transform (DFT) and that they exist for all lengths N for which the DFT is defined. The convolution property of the basefield transforms is derived and a condition for such transforms to have the self-inverse property is given. Also, fast algorithms for these basefield transforms are developed, showing gains when compared to computations using the FFT. Application of the methodology to Hartley transforms over R leads to a simple derivation of fast algorithms for computing real Hartley transforms. >