A complex Hadamard matrix is a square matrix H∈ MN (C) whose entries are on the unit
circle,| Hij|= 1, and whose rows and pairwise orthogonal. The main example is the Fourier …

In this paper, we generalize Sylvester's construction for (generalized) Hadamard matrices in
such a way that m matrices B/sub 1/, B/sub 2/,..., B/sub m/(not necessarily distinct) of the …

In 2023, it is 100 years after the introduction of Walsh functions and 50 years after the death
of their introducer Joseph Leonard Walsh. This paper is an homage to JL Walsh and …

A method to evaluate the Unified Complex Hadamard spectra of AND, OR, and XOR for
Boolean functions, directly from the spectra of the functions, is presented. The results are …

Fixed-Pipeline Two-Dimensional Hadamard Transform Algorithms | IEEE Transactions on
Signal Processing skip to main content ACM Digital Library home ACM home Google, Inc. (search) …

We associate to any given circulant complex matrix $ C $ another one $ E (C) $ such that $
E (E (C))= C^{*} $ the transpose conjugate of $ C. $ All circulant Hadamard matrices of order …

A square matrix H∈ MN (R) is called “almost Hadamard” if U= H/N is orthogonal, and locally
maximizes the 1-norm on O (N). We review our previous work on the subject, notably with …

We give general lower bounds on the maximal determinant of n by n {+ 1,-1}-matrices, both
with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier …

Active Addressing TM is a new electronic drive technique that makes it possible for fast-
responding supertwisted nematic (STN) LCDs to deliver full-motion video images without …

Many techniques for controlling the noise radiated by large structures require a large
number of inputs to the controller to produce global attenuation. Unfortunately, processing …