Open Access Open Access  Restricted Access Subscription or Fee Access

Design of High Accuracy Fixed Width Modified Booth Multiplier for MAC Unit

M. Thamaraiselvi, G.R. Mahendra Babu


In the majority of Digital Signal Processing (DSP)
applications the critical operations are the multiplication and
accumulation. Real-time signal processing requires high accuracy and high throughput Multiplier-Accumulator unit (MAC) to achieve a high performance digital signal processing system. We successfully proposed the MAC unit using high accuracy fixed-width Booth multiplier. The carry is generated from LSB minor part using Bitonic sorter based Carry generator. A sorting network is a special kind of
sorting algorithm, where the sequence of comparisons is not
data-dependent. Sorting network suitable for implementation in hardware or in parallel processor arrays. Bitonic sort is developed on the basis of the 0-1 principle. The 0-1-principle states that a comparator network that sorts every sequence of 0's and 1's in a sorting network. The simulation results show that the performance is superior to that using the direct-truncation fixed-width Booth multiplier.


Bitonic Sorter, Carry Generator, Digital Signal Processing, Multiplier-Accumulator Unit.

Full Text:



Jiun-Ping Wang, Shiann-Rong Kuang and Shish-Chang Liang, “High

accuracy fixed-width modified Booth multipliers for lossy applications”,

IEEE Trans. Very Large Scale Integr. (VLSI) Syst., Vol. 19, No.1, Jan

G. O. Young, A. Inoue, R. Ohe, S. Kashiwakura, S. Mitarai, T. Tsuru,

and T. Izawa, “A 4.1-ns compact 54 * 54 multiplier utilizing sign select

Booth encoders,” IEEE J. Solid-State Circuits, vol. 32, no. 11, pp.

–1682, Nov. 1997.

F. Elguibaly, “A fast parallel multiplier-accumulator using the modified

Booth algorithm,” IEEE Trans. Circuits Syst. II, Reg. Papers, vol. 47, no.

, pp. 902–908, Sep. 2000.

W.-C. Yeh and C.-W. Jen, “High-speed Booth encoded parallel

multiplier design,” IEEE Trans. Computers, vol. 49, no. 7, pp. 692–701,

July 2000.

K. Choi and M. Song, “Design of a high performance 32*32-bit

multiplier with a novel sign select Booth encoder,” in Proc. IEEE Int.

Symp. Circuits and Systems, 2001, vol. 2, pp. 701–704.

Y. C. Lim, “Single precision multiplier with reduced circuit complexity

for signal processing applications,” IEEE Trans. Computer, vol. 41, no.

, pp. 1333–1336, Oct. 1992.

M. J. Schulte and E. E. Swartzlander, Jr., “Truncated multiplication with

correction constant,” in Proc. VLSI Signal Processing, VI, New York,

, pp. 388–396.

S. S. Kidambi, F. El-Guibaly, and A. Antoniou, “Area-efficient

multipliers for digital signal processing applications,” IEEE Trans.

Circuits Syst. II, Exp. Briefs, vol. 43, no. 2, pp. 90–94, Feb. 1996.

M.-A. Song, L.-D. Van, and S.-Y. Kuo, “Adaptive low-error fixed width

Booth multipliers,” IEICE Trans. Fundamentals, vol. E90-A, no. 6, pp.

–1187, Jun. 2007.

Y.-C. Liao, H.-C. Chang, and C.-W. Liu, “Carry estimation for two’s

complement fixed-width multipliers,” in Proc. IEEE Workshop Signal

Processing Systems, 2006, pp. 345–350.

Z. Hong and R. Sedgewick, “Notes on merging networks,” in Proc.ACM

Symp. Theory Comput., 1982, pp. 296–302.

Young-Ho Seo, Dong-Wook Kim, “A New VLSI Architecture of Parallel

Multiplier–Accumulator Based on Radix-2 Modified Booth Algorithm”

IEEE Trans. Very Large Scale Integr. (VLSI) Syst., Vol. 18, No.2, Feb

A. A. Farooqui and V. G. Oklobdzija, “General data-path organization of

a MAC unit for VLSI implementation of DSP processors,” in Proc. IEEE

Int. Symp. Circuits Syst., 1998, vol. 2, pp. 260–263.

S.J. Jou, C.Y.Chen, E.C. Yang, and C.C.Su(1995), “A pipelined

Multiplier-accumulator using a high speed, low power static and dynamic

full adder design”, IEEE Custom Integrated circuit conference, 1995, pp.


Kihak Shin, Ik Kyun Oh, Sang Min, Beom Seom Ryu,Kie Young Lee and

Tae Won Cho “ A Multi-Level Approach to Low Power Mac Design”

IEEE Trans.VLSI systems, vol 48 , pp 361- 763, 1999.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.