Eigenvalues of Non-Sylvester Hadamard Matrices Constructed by Monomial Permutation Matrices

نویسندگان

  • Seung-Rae Lee
  • Koeng-Mo Sung
چکیده

In this paper, the eigenvalues of various non-Sylvester Hadamard matrices constructed by monomial permutation matrices are derived, which shows the relation between the eigenvalues of the newly constructed matrix and Sylvester Hadamard matrix. * The authors are with School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea, ([email protected]). Paper No.: kics2006-02-061. Date of submission: 2006-02-03. This work was supported by grant No. (R-01-2006-000-10717-0) from the Basic Research Program of the Korea Science & Engineering Foundation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Eigenvalues of Row-Inverted Sylvester Hadamard Matrices

In this paper, the eigenvalues of row-inverted 2 × 2 Sylvester Hadamard matrices are derived. Especially when the sign of a single row or two rows of a 2×2 Sylvester Hadamard matrix are inverted, its eigenvalues are completely evaluated. As an example, we completely list all the eigenvalues of 256 different row-inverted Sylvester Hadamard matrices of size 8. Mathematics Subject Classification (...

متن کامل

Ranks of Hadamard Matrices and Equivalence of Sylvester Hadamard and Pseudo-Noise Ma- trices

In this paper we obtain several results on the rank properties of Hadamard matrices (including Sylvester Hadamard matrices) as well as (generalized) Hadamard matrices. These results are used to show that the classes of (generalized) Sylvester Hadamard matrices and of generalized pseudo-noise matrices are equivalent, i.e., they can be obtained from each other by means of row/column permutations....

متن کامل

Complex Hadamard Matrices from Sylvester Inverse Orthogonal Matrices

A novel method to obtain parameterizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via doubling the size of inverse complex conference matrices. When the free parameters take values on the unit circle the inverse orthogonal matrices transform into...

متن کامل

Equivalence of Hadamard matrices and Pseudo-Noise matrices

Several classes of structured matrices (e.g., the Hadamard-Sylvester matrices and the pseudo-noise matrices) are used in the design of error-correcting codes. In particular, the columns of matrices belonging to the above two matrix classes are often used as codewords. In this paper we show that the two above classes essentially coincide: the pseudo-noise matrices can be obtained from the Hadama...

متن کامل

On Permanents of Sylvester Hadamard Matrices

It is well-known that a Sylvester Hadamard matrix can be described by means of a cocycle. In this paper it is shown that the additional internal structure in a Sylvester Hadamard matrix, provided by the cocycle, is su cient to guarantee some kind of reduction in the computational complexity of calculating its permanent using Ryser's formula. A Hadamard matrix H of order n is an n× n matrix with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006