Efficient systolic solution for a new prime factor discrete Hartley transform algorithm

Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N=4M, M being prime to 4. This paper proposes a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearly the same hardware requirement as that of the corresponding DFT structure for real-valued data; but it yields significantly higher throughput