Share Email Print

Proceedings Paper

Multiplicative-theorem-based fast Williamson-Hadamard transforms
Author(s): Sos S. Agaian; Hakob Sarukhanian; Jaakko T. Astola
Format Member Price Non-Member Price
PDF $14.40 $18.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

Hadamard matrices have received much attention in recent years, owing to their numerous known and promising applications. The difficulties of construction of N equalsV 0(mod 4)-point Hadamard transforms are related to the existence of Hadamard matrices problem. In this paper algorithms for fast computation of N-point Williamson-Hadamard transform based on multiplicative theorems are presented. Comparative estimates revealing the efficiency of the proposed algorithms with respect to the known ones are given. The results of numerical examples are presented.

Paper Details

Date Published: 22 May 2002
PDF: 10 pages
Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); doi: 10.1117/12.467969
Show Author Affiliations
Sos S. Agaian, Univ. of Texas/San Antonia and CUNY/College of Staten Island (United States)
Hakob Sarukhanian, Institute of Informatics and Automation Problems (Armenia)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 4667:
Image Processing: Algorithms and Systems
Edward R. Dougherty; Jaakko T. Astola; Karen O. Egiazarian, Editor(s)

© SPIE. Terms of Use
Back to Top