A Parallel Multiplier - Accumulator Based On Radix - 2 Modified Booth Algorithm By Using Spurious Power Suppression Tecnique

S. Tabasum*, M.P. Chennaiah**
* M.Tech Student , SSITS, Rayachoty, Kadapa Dist., India.
** Associate Professor, SSITS, Rayachoty, Kadapa Dist., India.
Periodicity:February - April'2013
DOI : https://doi.org/10.26634/jes.2.1.2239

Abstract

In this paper, the authors proposed a new architecture of Multiplier-And-Accumulator (MAC) for high-speed arithmetic. This can be implement by using radix-2 booth encoder .By combining multiplication with accumulation and devising a hybrid type of Carry Save Adder (CSA), the performance was improved. This includes the design exploration and applications of a Spurious-Power Suppression Technique (SPST) which can dramatically reduce the power dissipation of combinational VLSI designs. Power dissipation is recognized as a critical parameter in modern VLSI field. In Very Large Scale Integration(VLSI), Low power VLSI design is necessary to meet MOORE'S law and to produce consumer electronics with more back up and less processing systems. The proposed MAC accumulates the intermediate results in the type of sum and carry bits instead of the output of the final adder, which made it possible to optimize the pipeline scheme to improve the performance. The objective of a good multiplier is to provide a physically compact, good speed and low power consuming chip. To save significant power consumption of a VLSI design, it is a good direction to reduce its dynamic power that is the major part of power dissipation.

Keywords

Low-power Design, Array Multiplier, Booth Encoder, Carry Save Adder, Accumulation, SPST Adder, Multiplier and- Accumulator (MAC).

How to Cite this Article?

Tabasum.S., and Chennaiah.M.P. (2013). A Parallel Multiplier - Accumulator Based on Radix - 2 Modified Booth Algorithm by Using Spurious Power Suppression Technique. i-manager’s Journal on Embedded Systems, 2(1), 7-13. https://doi.org/10.26634/jes.2.1.2239

References

[1]. O.L. MacSorley, (1961). "High speed arithmetic in binary computers," Proc. IRE, Vol. 49, pp. 67-91, Jan. 1961.
[2]. A.D. Booth, (1952). "A signed binary multiplication technique," Quart. J. Math., Vol. 4, pp. 236-240, 1952.
[3]. C.S. Wallace, (1964). "A suggestion for a fast multiplier," IEEE Trans. Electron Comput., Vol. EC-13, No. 1, pp. 14-17, Feb. 1964.
[4]. A.R. Cooper, (1988). "Parallel architecture modified Booth multiplier," Proc. Inst. Electr. Eng. G, Vol. 135, pp. 125- 128, 1988.
[5]. N.R. Shanbag and P. Juneja, (1988). "Parallel implementation of a 4?4-bit multiplier using modified Booth's algorithm," IEEE J. Solid-State Circuits, Vol. 23, No. 4, pp. 1010-1013, Aug. 1988.
[6]. G. Goto, T. Sato, M. Nakajima, and T. Sukemura, (1992). "A 54?54 regular structured tree multiplier," IEEE J. Solid- State Circuits, Vol. 27, No. 9, pp. 1229-1236, Sep. 1992.
[7]. J. Fadavi-Ardekani, (1993). "MN Booth encoded multiplier generator using optimized Wallace trees," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., Vol. 1, No. 2, pp. 120-125, Jun. 1993.
[8]. N. Ohkubo, M. Suzuki, T. Shinbo, T. Yamanaka,A. Shimizu,K. Sasaki,and Y. Nakagome, (1995). "A 4.4 ns CMOS 54?54 multiplier using pass-transistor multiplexer”, IEEE J. Solid-State Circuits, Vol. 30, No. 3, pp. 251-257, Mar. 1995.
[9]. A. Tawfik, F. Elguibaly, and P. Agathoklis, (1997). "New realization and implementation of fixed-point IIR digital filters," J. Circuits, Syst., Comput., Vol. 7, No. 3, pp. 191- 209, 1997.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.