Multiplicative-theorem-based fast Williamson-Hadamard transforms

Sos S. Agaian; Hakob Sarukhanian; Jaakko T. Astola

doi:10.1117/12.467969

22 May 2002 Multiplicative-theorem-based fast Williamson-Hadamard transforms

Sos S. Agaian, Hakob Sarukhanian, Jaakko T. Astola

Proceedings Volume 4667, Image Processing: Algorithms and Systems; (2002) https://doi.org/10.1117/12.467969
Event: Electronic Imaging, 2002, San Jose, California, United States

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.

Citation Download Citation

Sos S. Agaian, Hakob Sarukhanian, and Jaakko T. Astola "Multiplicative-theorem-based fast Williamson-Hadamard transforms", Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); https://doi.org/10.1117/12.467969

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