Fast, Reliable & Secure Digital Communication Using Hadamard Matrices

Abstract

The symmetric, orthogonal and self-inverting properties of Hadamard matrices make them useful for a number of present day applications. In addition, the binary nature of elements of the basis vectors helps in the design of efficient algorithms for coding, compression and security of digital media together with their compact hardware realization. This paper presents schemes for providing fast, reliable and secure communications over resource constrained wireless networks using Hadamard matrices. Error-correction and bandwidth expansion capabilities are demonstrated for unobtrusive communication of text and speech. Fast encryption of speech signal using permutations on Hadamard matrices is demonstrated. Techniques for extending the key-space for improving the security of such schemes are also reported