On prime factor mapping for the discrete Hartley transform

The authors propose a new prime factor mapping scheme, which requires no extra arithmetic operations for the realization of prime factor mapping, for the computation of the discrete Hartley transform (DHT). It is achieved by embedding all the extra arithmetic operations into the subsequent short-length computations, with the computational complexities of these embedded short lengths remaining unchanged. Consequently, the present approach significantly eliminates the burden which is introduced by the extra arithmetic operations. With this mapping scheme, it is further demonstrated that a prime-factor-mapped DHT would have superb performance compared with other fast DHT algorithms