A combinatorial complex multiplier has been designed for use in a pipelined
fast Fourier transform processor. The performance in terms of throughput o
f the processor is limited by the multiplication. Therefore, the multiplier
is optimized to make the input-to-output delay as short as possible, A new
architecture based on distributed arithmetic, Wallace-trees. and carry-loo
kahead adders has been developed. The multiplier has been fabricated using
standard cells in a 0.5-mu m process and verified for functionality, speed,
and power consumption. Running at 40 MHz, a multiplier with input wordleng
ths of 16+16 times 10+10 bits consumes 54% less power compared to an distri
buted arithmetic array multiplier fabricated under equal conditions.