Equivalence of Hadamard matrices and pseudo-noise matrices

T. Bella; V. Olshevsky; L. Sakhnovich

doi:10.1117/12.623303

16 September 2005 Equivalence of Hadamard matrices and pseudo-noise matrices

T. Bella, V. Olshevsky, L. Sakhnovich

Proceedings Volume 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV; 59100V (2005) https://doi.org/10.1117/12.623303
Event: Optics and Photonics 2005, 2005, San Diego, California, United States

Abstract

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 Hadamard-Sylvester matrices by means of the row/column permutations.

Citation Download Citation

T. Bella, V. Olshevsky, and L. Sakhnovich "Equivalence of Hadamard matrices and pseudo-noise matrices", Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100V (16 September 2005); https://doi.org/10.1117/12.623303

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available