Name
Abstract | ||
|---|---|---|
Hadamard matrices have received much attention in recent years, owing to their numerous known and promising applications. The difficulties of construction of N equivalent to 0(mod4)-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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1117/12.467969 | IMAGE PROCESSING: ALGORITHMS AND SYSTEMS |
Keywords | Field | DocType |
algorithms,transform theory,matrices | Discrete mathematics,Hadamard matrix,Paley construction,Multiplicative function,Hadamard product,Pure mathematics,Hadamard's inequality,Complex Hadamard matrix,Hadamard code,Hadamard transform,Mathematics | Conference |
Volume | ISSN | Citations |
4667 | 0277-786X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sos Agaian | 1 | 67 | 16.48 |
| hakob sarukhanian | 2 | 0 | 0.34 |
| Jaakko Astola | 3 | 1515 | 230.41 |