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. In this paper, we have proposed 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.