EFFICIENT SYSTOLIC SOLUTION FOR A NEW PRIME FACTOR DISCRETE HARTLEY TRANSFORM ALGORITHM

Recently, a novel systolic structure has been proposed for the computa tion of DFT for transform length N = 4M, M being prime to 4. In this p aper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also propo sed for computing DHT using a linear systolic array of cordic processi ng elements. The proposed structure has nearly the same hardware requi rement as that of the corresponding DFT structure for real-valued data ; but it yields significantly higher throughput.