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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call