Share Email Print

Proceedings Paper

Equivalence of Hadamard matrices and pseudo-noise matrices
Author(s): T. Bella; V. Olshevsky; L. Sakhnovich
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 16 September 2005
PDF: 7 pages
Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100V (16 September 2005); doi: 10.1117/12.623303
Show Author Affiliations
T. Bella, Univ. of Connecticut (United States)
V. Olshevsky, Univ. of Connecticut (United States)
L. Sakhnovich, Univ. of Connecticut (United States)

Published in SPIE Proceedings Vol. 5910:
Advanced Signal Processing Algorithms, Architectures, and Implementations XV
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top