Derivation of fast algorithms via binary filtering of signals

Abstract

We present a new way to derive a fast algorithm realizing the discrete Walsh transform (DWT), which can be applied both in the traditional form, i.e., to a one-dimensional numerical array, and to a multi-dimensional array, as well as for a signal of a continuous argument in the form of a function or an image. The algorithm is presented as iterated application of the primitive discrete Haar transform (DHT) over two variables. Two standard ways of arranging the results of this simplest transform lead to the fast DWT in the Hadamard or Paley enumeration in the case of splitting the signal into equal parts. Application of the algorithm to analogous shifts of the periodic source signal results in longitudinal filtering of a signal via decomposing it into a sum of simpler signals. In an incomplete version of the last algorithm, we come to an analog of the fast DHT.