Fast computation of discrete Hartley transform via Walsh–Hadamard transform

23 April 1987

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 23 (9) , 466-468
https://doi.org/10.1049/el:19870336

Abstract

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.

Keywords

INTERFRAME BASIS
ORTHONORMAL MATRIX
COMPUTATIONAL COMPLEXITY
PARALLEL PROCESSING
FAST ALGORITHM
DERIVATION
BLOCK-DIAGONAL STRUCTURE
DHT
DISCRETE HARTLEY TRANSFORM
H-TRANSFORM MATRIX
FAST COMPUTATION
WALSH-HADAMARD TRANSFORM
WHT

This publication has 0 references indexed in Scilit: