Fast computation of discrete Hartley transform via Walsh–Hadamard transform
Chau‐Yun Hsu, Ja‐Ling Wu · Electronics Letters · 1987
A new fast algorithm is proposed to compute the discrete Hartley transform (DHT) via the Walsh–Hadamard transform (WHT). The processing is carried out on an interframe basis in (N × N) data blocks, where N is an integer power of two. The WHT coefficients are obtained directly, and then used to obtain the DHT coefficients. This is achieved by a transform matrix, the H-transform matrix, which is ortho-normal and has a block-diagonal structure. A complete derivation of the block-diagonal structure for the H-transform matrix is given.