Trade-offs in fixed-point multiplication algorithms for microprocesors

Abstract

Multiplication algorithms which are appropriate for 8-bit microprocessors are discussed, particularly within the context of signal-processing needs, where minimisation of execution time is important. The trade-offs which exist between minimum memory, minimum execution time and minimum cost are discussed in detail, and specific examples based on the Z80 processor are included to provide a quantitative comparison of the alternatives.