A new fast recursive algorithm for computing discrete Hartley transform and its implementation

摘要

The Hartley transform is more efficient and economical than the Fourier transform for real series data processing in several applications. This paper presents a block decomposition representation of discrete Hartley transform (DHT) coefficient matrix in view of algebra, from which a new fast recursive algorithm is derived.