
In mathematics, a Walsh matrix is a specific square matrix, with dimensions a power of 2, the entries of which are +1 or -1, and the property that the dot product of any two distinct rows (or columns) is zero. The Walsh matrix was proposed by Joseph Leonard Walsh in 1923.[1] Each row of a Walsh matrix corresponds to a Walsh function.
The natural ordered Hadamard matrix is defined by the recursive formula below, and the sequency ordered Hadamard matrix is formed by rearranging the rows so that the number of sign-changes in a row is in increasing order.[1] Confusingly, different sources refer to either matrix as the Walsh matrix.
The Walsh matrix (and Walsh functions) are used in computing the Walsh transform and have applications in the efficient implementation of certain signal processing operations.
The Hadamard matrices of dimension 2k for
are given by the recursive formula



and in general

for
, where
denotes the Kronecker product.
The sequency ordering of the rows of the Walsh matrix can be derived from the ordering of the Hadamard matrix by first applying the bit-reversal permutation and then the Gray code permutation.[2]
e.g. 
where the successive rows have 0, 1, 2, and 3 sign changes.
Why are we here?
All text is available under the terms of the GNU Free Documentation License
This page is cache of Wikipedia. History