It says that a wallace tree can be used to perform multiplication in a single cycle.
I'm assuming then that a technique like Booth's recoding takes multiple cycles for outputting a product?
By why exactly does a wallace tree only take one cycle to output a product?
I've read about the process on wikipedia: http://en.wikipedia.org/wiki/Wallace_tree, but I can't grasp the cycle argument.
Is wallace tree better/faster than other multiplication techniques?