Constant Coefficient Multiplication Using Look-Up Tables

Multiplication is an important but expensive operation in most FPGA-based signal processing systems. Many techniques have been introduced for reducing the size and improving the speed of FPGA-based multipliers. Constant-coefficient multipliers are an important class of such multipliers that reduce FPGA resource requirements by exploiting constant-specific optimizations. This paper reviews and analyzes a constant coefficient multiplier that exploits the fine-grain memory resources of FPGAs by performing table look-up. Several optimizations to this multiplier are introduced and analyzed. This paper will also introduce several techniques for reducing the resources of this multiplier by exploiting modern FPGA architectural enhancements.

[1]  Roger F. Woods,et al.  An investigation of reconfigurable multipliers for use in adaptive signal processing , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[2]  David R. Martinez,et al.  Field programmable gate array based radar front-end digital signal processing , 1999, Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00375).

[3]  Brent E. Nelson,et al.  Gigaop DSP on FPGA , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[4]  Milos D. Ercegovac,et al.  Fast on-line multiplication units using LSA organization , 1999, Optics & Photonics.

[5]  Roger F. Woods,et al.  Multiplexer Based Reconfiguration for Virtex Multipliers , 2000, FPL.

[6]  Todd A. Cook,et al.  Implementation of IEEE single precision floating point addition and multiplication on FPGAs , 1996, 1996 Proceedings IEEE Symposium on FPGAs for Custom Computing Machines.

[7]  Michael J. Wirthlin,et al.  Efficient Constant Coefficient Multiplication Using Advanced FPGA Architectures , 2001, FPL.

[8]  Peter M. Athanas,et al.  Computing kernels implemented with a wormhole RTR CCM , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[9]  Brad L. Hutchings,et al.  Improving functional density using run-time circuit reconfiguration [FPGAs] , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[10]  Florent de Dinechin,et al.  Constant Multipliers for FPGAs , 2000, PDPTA.

[11]  Steven A. Guccione,et al.  Automated extraction of run-time parameterisable cores from programmable device configurations , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[12]  Mark Shand,et al.  Hardware speedups in long integer multiplication , 1991, SIGARCH Comput. Archit. News.