Abstract
It is shown that the discrete Hartley transform can be mapped to a special hardware structure suitable for implementation, using transversal filter type structures, when the number of the input data samples is prime. This transform appears to be simpler and faster than the prime number Fourier transform calculated by the same approach.

This publication has 0 references indexed in Scilit: