A Structured Dual Split-Radix Algorithm for the Discrete Hartley Transform of Length $$2^{N}$$ 2 N

Abstract

This paper presents a new split-radix algorithm for DHT of length \({N}=2^{n}\), called the Dual Split-Radix DHT (DSR DHT), that allows an efficient parallel implementation using a dual core system. Moreover, as it is different from existing split-radix algorithms for DHT, it offers an efficient hardware implementation similar to that for FFT. It avoids the so-called retrograde indexing specific to existing DHT algorithms that do not allow an efficient pipeline implementation.