Computing Discrete Hartley Transform Using Algebraic Integers

An algorithm for computing the discrete Hartley transform is presented that is based on the algebraic integers encoding scheme. With the aid of this scheme, an error-free representation of the cas function becomes possible. In addition, for further complexity reduction an approximation scheme is proposed. Finally, for the implementation of the algorithm a fully pipelined systolic architecture with O(N) throughput is proposed