In the above note,1a method is presented for forming a Walsh function, wal(n,θ), where n is the order and θ is the normalized time. A binary representation of n is converted to a Gray code, after which the Rademacher functions corresponding to the ONE bits in the Gray code are multiplied to synthesize a Walsh function. A simple extension of this method allows evaluation of any arbitrary point on the nth Walsh function without listing tables of Rademacher functions R(m,θ).

An iterative array for multiplication of signed binary numbers is described. It uses controlled adder-subtractor cells. The negative numbers are in two's complement form and the product, if negative, is also available in this form without requiring any additional operations.

An alternative cellular array design is described for nonrestoring extraction of square roots. The array uses a single type of adder/ subtractor cell with a near-iterative connection pattern.