Skip to main content
Log in

Abstract

Constant-coefficient multipliers are used in many DSP cores. A new low-power constant multiplier, with detailed design procedure, is presented. By using canonical sign-digit (CSD) number system, and introducing new simplification techniques and identities, the multiplier features a new algorithm to reduce logic depth for the Wallace-tree implementation. The method also reduces area and complexity.

A generator written in C++ is used to generate technology-independent VHDL code of the constant multiplier for different input specifications. Synthesis results indicate the new design has smaller area and less power consumption while offering similar speed performance when compared with other multipliers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. Farag and M. Elmasry, “Low-Power Implementation of Discrete Cosine Transform,” in Sixth Great Lakes Symposium on Proceedings VLSI, 1996, pp. 174–177.

  2. M. Kuhlmann and K. Parhi, “Power Comparison of Flow-Graph and Distributed Arithmetic Based DCT Architectures,” in Conference Record of the 32nd Asilomar Conference on Signals, Systems & Computers, 1998, vol. 2, pp. 1214–1219.

    Google Scholar 

  3. R.V. Pillai, S.Y.A. Shah, A.J. Al-Khalili, and D. Al-Khalili, “Low Power Floating MAFs-A Comparative Study,” in Proceedings of the 6th International Symposium on Signal Processing and Applications. pp. Aug. 13–16. ISBN: 0-7803-6704-9.

  4. K. Hwang, Computer Arithmetic-Principles, Architecture, and Design, John Wiley & Sons, 1979, pp. 152–155.

  5. K. Hwang, Computer Arithmetic-Principles, Architecture, and Design, John Wiley & Sons, 1979, pp. 149–151.

  6. F. de Dinechine and V. Lef'evre, “Constant Multipliers for FPGAs,” LIP Research Report RR2000-18, Laboratoire d'Informatique du Parall´elisme, Lyon, France, 2000.

    Google Scholar 

  7. V. Lef'evre, “Multiplication by an Integer Constant,” LIP Research Report RR1999-06, Laboratoire d'Informatique du Parall´elisme, Lyon, France, 1999.

    Google Scholar 

  8. R. Bernstein, “Multiplication by Integer Constants, Software-Practice and Experience,” vol. 16, no. 7, 1986, pp. 641–652.

    Article  Google Scholar 

  9. M. Potkonjak, M. Srivastava, and A. Chandrakasan, “Multiple Constant Multiplications: Efficient and Versatile Frameworks for Exploring Common Subexpression Elimination,” IEEE Trans. on CAD of IC and Systems, vol. 15, no. 2, 1996, pp. 151–165.

    Article  Google Scholar 

  10. Xilinx Cooperation, “Constant (k) Coefficient Multiplier Generator for Virtex,” March 12, 1999.

  11. Xilinx Cooperation, “Constant Coefficient Multipliers for XC4000E,” Dec. 11, 1996.

  12. R. Hartley, “Optimization of Canonical Sign Digit Multipliers for Filter Design,” in IEEE International Sympoisum on Circuits and Systems, 1991, vol. 4, pp. 1992–1995, 1991.

    Google Scholar 

  13. S. Shah and A.J. Al-Khalili, and D. Al-Khalili, “Comparison of 32-bit Multipliers of Various Performance Measures,” in Proceedings of the 12th International Conference on Microelectronics, ICM'2000, October 31–Nov. 2, 2000, pp. 75–80.

  14. Najam-Uz Zarman and A.J. Al-Khalili, “32-bit Constant-Coefficient Multiplier,” in Proceedings of TENCON 2001, Singapore, Aug. 19–22, 2001, pp. 306–308.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pai, CY., Al-Khalili, A. & Lynch, W. Low-Power Constant-Coefficient Multiplier Generator. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 35, 187–194 (2003). https://doi.org/10.1023/A:1023604700591

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023604700591

Navigation