Hadamard Transform - Computational Complexity

Computational Complexity

The Hadamard transform can be computed in n log n operations (n = 2m), using the fast Hadamard transform algorithm.

Read more about this topic:  Hadamard Transform

Famous quotes containing the word complexity:

    The price we pay for the complexity of life is too high. When you think of all the effort you have to put in—telephonic, technological and relational—to alter even the slightest bit of behaviour in this strange world we call social life, you are left pining for the straightforwardness of primitive peoples and their physical work.
    Jean Baudrillard (b. 1929)