Prime-factor Hartley and Hartley-like transform calculation using transversal filter-type structures

The advances in digital fabrication technology have led to a new generation of integrated circuits capable of performing fast arithmetic operations, and opened the door to the consideration of algorithms that may be implemented with simple structures. When the number of data samples in the input block is prime or a product of primes, the Hartley transform can readily be mapped to circular convolutions and then implemented using transversal filter-type structures. Such a structure is simple and regular, and hence it is suitable for VLSI implementation. The Hartley transform is real-to-real and it is the same for both forward and inverse transformations. Hence, it is simpler and may therefore be somewhat faster than the DFT implemented by the same approach.