Decomposition of binary matrices and fast Hadamard transforms (Q2493321): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:12, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of binary matrices and fast Hadamard transforms |
scientific article |
Statements
Decomposition of binary matrices and fast Hadamard transforms (English)
0 references
12 June 2006
0 references
The authors introduce a general algorithm for decomposing binary \((1,-1)\) matrices and develop a fast Hadamard transform algorithm that runs in \(O(N \log_2 N)\) time for \(N = 4\cdot k\). The proposed algorithm has a symmetric structure, uses no padding with zeros for dimensions different from powers of 2, and is 5\ 8\ coding, signal processing etc.
0 references
binary matrix
0 references
\((1, -1)\) matrix
0 references
Hadamard matrix
0 references
algorithm
0 references
