Skip to Main Content
In this brief, a new efficient radix-2 fast algorithm for the computation of type-III discrete Hartley transform of length that has a small arithmetic cost and is well suited for a very large-scale integration (VLSI) implementation is presented. This recursive method requires a small number of arithmetic operations compared with existing methods, has a regular and simple computational structure, and can be easily implemented. A small number of arithmetic operations are achieved with the proposed algorithm as compared with existing algorithms. Moreover, the regular and simple computational structure and the existing parallelism of the proposed algorithm offer the possibility of an efficient fast parallel VLSI implementation.