A new radix-2nmultiplication algorithm is presented which is iterative and modular. The algorithm is a true generalisation of the radix-2 (conventional binary) multiplication algorithm. As a result, existing radix-2 (binary) structures can easily be generalised for all radices. The architecture of the basic cell is not fixed for all radices: any architecture can be used if its functionality satisfies the multiply/add principle presented. The multiplier architecture is first defined in terms of the radix-2nmultiplication algorithm which is general for alln. This results in an architecture being available for everyn. The tradeoff between cost and time is achieved by optimising the basic cell architecture for each radix and choosing the radix that results in the best performance. This approach is applied to the design of serial and serial/parallel multipliers, and an iterative multiplier array.