Skip to main content
Log in

Abstract

This paper describes the design of a 16×16 redundant binary multiplier for signed 2's complement numbers. The multiplier uses a new coding scheme for representing radix-2 signed digits. The coding results in a factor of two reduction in the number of summands used with respect to the modified Booth algorithm. The design has a small number of modular cells and regular routing, making it suitable for automatic synthesis of larger data-width multipliers. In addition, the row-based redundant binary adder tree is an ideal structure for high-throughput applications.

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. Y. Harata, et al., “A High-Speed Multiplier Using a Redundant Binary Adder Tree,”IEEE Journal of Solid State Circuits, vol. SC-22, 1987, pp. 28–34.

    Article  Google Scholar 

  2. K.F. Pang, et al. “Generation of High Speed CMOS Multiplier-Accumulator,”IEEE International conference on Computer Design (ICCD 88),

  3. M. Birman, et al. “Desig of a High-Speed Arithmetic Datapath,”IEEE International Conference on Computer Design (ICCD 88), pp. 214–216.

  4. C.S. Wallace, “A Suggestion for a Fast Multiplier,”IEEE Trans. on Electronic Computer vol. EC-13, 1964, pp. 14–17.

    Article  MATH  Google Scholar 

  5. S. Waser and M.J. Flynn,Introduction to Arithmetic for Digial Systems Designers, New York: Holt, Rinehart, and Winston, 1982.

    Google Scholar 

  6. Naofumi Takagi, Hiroto Yasuura, and Shuzo Yajima, “High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree,”IEEE Trans. on Computers, vol. C-34, 1985.

  7. Shigeo Kuniobu, et al., “Design of High Speed MOS Multiplier and Divider Using Redundant Binary Representation,”8th Symposium on Computer Arithmetic, 1987, pp. 80–86.

  8. Hisakazu Edamatsu, et al., “A 33 MFLOPS Floating Point Processor using Redundant Binary Representation,”1988 ISSCC Digest of Technical Papers, 1988, pp. 152–153.

  9. A. Aviziens, “Signed-Digit Number Representations for Fast Parallel Arithmetic,”IRE Trans. on Electronic Computers, vol. EC-10, 1961, pp. 389–400.

    Article  Google Scholar 

  10. Catherine Chow and James Robertson, “Logical Design of a Redundant Binary Adder,”4th Symposium on Computer Arithmetic, 1978, pp. 109–115.

  11. N. Weste and K. Eshraghian,Principles of CMOS VLSI Design: A System Perspective, Reading, MA: Addison-Wesley, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported in part by National Science Foundation grant MIP-9019862.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X., Wei, B.W.Y., Chen, H. et al. High-performance VLSI multiplier with a new redundant binary coding. J VLSI Sign Process Syst Sign Image Video Technol 3, 283–291 (1991). https://doi.org/10.1007/BF00936901

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00936901

Keywords

Navigation