IEEE Transactions on Information Theory · 1979 · 30 citations · 13 references
ComputingComputer ScienceComputational GeometryData StructuresParallel ComputingDimensionality ReductionMatrix ComputationMatrix StructureParallel Numerical Linear AlgebraCorrelation Matrix
The concept of a Hadamard matrix as a binary orthogonal matrix is extended to higher dimensions. An <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -dimensional Hadamard matrix <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[h_{ijk \cdots n}]</tex> is defined as one in which all parallel <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(n - 1)</tex> -dimensional layers, in any axis-normal orientation, are uncorrelated. This is equivalent to the requirements that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">h_{ijk \cdots n} = \pm1</tex> and that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\sum_{p} \sum_{q} \sum_{r} \cdots \sum_{y} h_{pqr \cdots yb}= m^{(n-1)} \delta_{ab}</tex> where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(pqr \cdots yz)</tex> represents all permutations of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(ijk \cdots n)</tex> . A "proper" <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -dimensional Hadamard matrix is defined as a special case of the above in which all two-dimensional layers, in all axis-normal orientations, are Hadamard matrices, as a consequence of which all intermediate-dimensional layers are also Hadamard matrices. Procedures are described for deriving three- and four-dimensional Hadamard matrices of varying propriety from two-dimensional Hadamard matrices. A formula is given for a fully proper <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -dimensional matrix of order two, which can be expanded by direct multiplication to yield proper <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(2^{t})^{n}</tex> Hadamard matrices. It is suggested that proper higher dimensional Hadamard matrices may find application in error-correcting cedes, where their hierarchy of orthogonalitias permit a variety of checking procedures. Other types of Hadamard matrices may be of use in security codes on the basis of their resemblance to random binary matrices.
13
Hadamard transform image coding
William K. Pratt, Julius Kane, Harry C. Andrews · Proceedings of the IEEE · 1969 · 662 citations
R. E. A. C. Paley · Journal of Mathematics and Physics · 1933 · 607 citations
Hadamard Matrices and Their Applications
A. Hedayat, W. D. Wallis · The Annals of Statistics · 1978 · 388 citations · Full text