SYSTEM AND METHOD FOR COMPUTING AN UNORDERED HADAMARD TRANSFORM

A system and method for parallel computation of the unordered Hadamard transform. The computing system includes a plurality of interconnected processors and corresponding local memories. An input signal x is received, partitioned into M1 sub-vectors xi of length M2, and distributed to the local memories. Each processor computer a Hadamard transform (order M2) on the sub-vectors in its local memory (in parallel), generating M1 result sub-vectors ti of length M2, which compose a vector t of length M1×M2. A stride permutation (stride M2) is performed on t generating vector u. Each processor computes a Hadamard transform (order M1) on the sub-vectors uj in its local memory (in parallel), generating M1 result sub-vectors vj of length M2, which compose a vector v of length M2×M1. A stride permutation is performed on v (stride M1) generating result vector w, which is the Hadamard transform of the input signal x.