In this paper, comparison of various orthogonal transforms in Wiener filtering is discussed. The study involves the family of discrete orthogonal transforms called Complex Hadamard Transform, which has been recently introduced by the same authors. Basic definitions, properties and transformation kernel of Complex Hadamard Transform are also shown.

This paper establishes a general relation between the two-dimensional Least Mean Square (2-D LMS) algorithm and 2-D discrete orthogonal transforms. It is shown that the 2-D LMS algorithm can be used to compute the forward as well as the inverse 2-D orthogonal transforms in general for any input by suitable choice of the adaptation speed. Simulations are presented to verify the general relationship results.