Design and Analysis of 8-bit Array, Carry Save Array, Braun, Wallace Tree and Vedic Multipliers
DOI:
https://doi.org/10.61841/j1071d83Keywords:
Array Multiplier, Carry Save Array Multiplier, Wallace Tree Multiplier, Braun Multiplier, Vedic MultiplierAbstract
Multiplier is the basic building block for several applications, like digital signal processing processors and digital image processing. In this paper, we have designed an 8-bit array, a carry-save array, a Braun, Wallace tree, and a Vedic multiplier. And we have analyzed speed, area, and power. The design was implemented using Verilog HDL coading, simulated, and synthesized using the Xilinx Tool.
Downloads
References
[1] V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 2nd edition, Prentice Hall, 1999.
[2] H. A. Al-Twaijry, Area and performance optimized CMOS multipliers, Ph.D. dissertation, Stanford
University, Aug. 1997.
[3] S. Wallace, A Suggestion for a Fast Multiplier, IEEE Transactions on Electronic Computers, vol. 13, pp.
14-17, 1964 [4] L. Dadda, Some Schemes for Parallel Multipliers, Alta Frequenza, vol. 34, pp. 349-356,
1965.
[4] Earl E. Swartzlander, Jr., High-Speed Computer Arithmetic, Chapter 22 in 2ed. Computer Science
Handbook, Boca Raton, FL: Chapman and Hall/CRC, 2004.
[5] Gowthami, P., and R.V.S. Satyanarayana, ”Design of an Efficient Multiplier Using Vedic Mathematics and
Reversible Logic,"2016 IEEE International Conference on Computational Intelligence and Computing
Research.
[6] Poras T. Balsara and David T. Harper, Understanding VLSI bit serial multiplier, IEEE Trans. on
Education, Vol. 39, No. 1, Feb. 1996.
[7] R.Gnanasekaran, A fast serial-parallel binary multiplier, IEEE Trans. Computer, Vol. C-34, No. 8, pp. 741–741.
744, Aug. 1985.
[8] Gensuke Goto, Tomio Sato, Masao Nakajima, and Takao Sukemura, A 54X54 regular structured tree
multiplier, IEEE J. Of Solid State Circuits, Vol. 27, No. 9, pp. 1229-1236, Sept. 1992.
[9] H. I. Saleh, A. H. Khalil, M. A. Ashour, and A. E. Salama, Novel serial parallel multipliers, IEE Proccircuits Devices System, Vol. 148, No. 4, pp. 183-189, Aug. 2001.
[10] A.D. Booth, A signed binary multiplication technique, Quarterly J.Mech. Appl. Math, Vol. 4, Part 2, pp.
236-240, 1951.
[11] L. P. Rubinfield, A proof of the modified booth’s algorithm for multiplication, IEEE Trans. on Computers,
Vol. 24, No. 10, pp. 1014-1015, Oct. 1975.
[12] K. Choi and M. Song, Design of a high-performance 32*32-bit multiplier with a novel sign select Booth
encoder, in Proc. 2001 IEEE Int. Symp. Circuits and Systems, Vol. 2, pp. 701–704, May 2001.
[13] K-Y. Khoo, Z. Yu, and A.N. Willson, Improved-Booth encoding for lowpower multipliers, in Proc. 1999
IEEE Int. Symp. Circuits and Systems, Vol. 1, pp. 62-65, May 1999.
[14] Villeger and V. G. Oklobdzija, ”Analysis of Booth encoding efficiency in parallel multipliers using
compressors for reduction of partial products, Proceedings of the 27th Asilomar Conference on Signals,
Systems and Computers, pp. 781-784, 1993.
[15] H. Sam and A. Gupta, A generalized multibit recoding of two complement binary numbers and its proof
with application in multiplier implementations, IEEE Trans. Computer, Vol. 39, No. 8, pp. 1006-1015, Aug.
1990.
[16] E. Atkin, Design Of arithmetic UNITS OF Illinois III: Use of redundancy and higher radix method, IEEE
Trans. on Computer, Vol. C-19, No. 8, pp. 720-733, Aug. 1970.
[17] C.R. Baugh and B.A. Wooley, A two’s complement parallel array multiplication algorithm, IEEE Trans.
Computers, Vol. 22, No. 12, pp. 1045-1047, Dec. 1973.
[18] P.E. Blankenship, Comments on a two’s complement parallel array multiplication algorithm, IEEE Trans.
Computers, Vol. 23, pp. 1327, 1974.
[19] Ahmed M. Shams, Tarek K. Darwish and Magdy A. Bayoumi, Performance analysis of low-power 1-bit
CMOS full adder cells, IEEE Transactions On Very Large Scale Integration (VLSI) Systems, Vol. 10, No.
1, pp. 20-29, Feb. 2002.
[20] Hung Tine Bui, Yuke Wang, and Yingtao Jiang, Design and analysis of low-power 10-transistor full adder
using novel XOR XNOR gates, IEEE Trans. On Circuits And Systems-II: Analog And Digital Signal
Processing, Vol. 49, No. 1, pp. 25-30, Jan. 2002.
[21] Hiroshi Makino, Yasunobu Nakase, Hiroaki Suzuki, Hiroyuki Morinaka, Hirofumi Shinohara, and Koichiro
Mashiko, An 8.8-ns 54 x 54-Bit multiplier with high-speed redundant binary architecture, IEEE J. Of Solid
State Circuits, Vol. 31, No. 6, pp. 773-783, June 1996.
[22] T. Shen and A. Weinberger, 4-2 carry-save adder implementation using send circuits, In IBM Technical
Disclosure Bulletin, pp. 35943597, February 1978.
[23] Qi Wang and Yousef R. Shayan, A versatile signed array multiplier suitable for VLSI implementation, in
proc. IEEE CCECE 2003, Vol. 1, pp. 199-202, May 2003.
[24] K. Prasad and K.K. Parhi, Low-power 4-2 and 5-2 compressors, Proc. of 2001 Asilomar Conf. on Signals,
Systems and Computers, Pacific Grove, CA, USA, Vol. 1, pp. 129-133, Nov. 2001.
[25] P.J. Song and G. De Micheli, Circuit and architecture trade-off for highspeed multiplication, IEEE J. SolidState Circuits, Vol. 26, pp. 1184-1198, Sept. 1991.
[26] Shen-Fu Hsiao, Ming-Roun Jiang, and Jia-Sien Yeh, Design of high-speed low-power 3-2 counter and 4-2
compressor for fast multipliers, IEE Electronics Letters, Vol. 34, No. 4, pp. 341-343, Feb. 1998.
[27] Chidgupkar P.D. and Karad M.T. (2004), The Implementation of Vedic Algorithms in Digital Signal
Processing, Global Journal of Engg Education, Vol. 8, No. 2, Australia.
[28] Thapliyal H. and Srinivas M.B. (2004), High Speed Efficient N x N Bit Parallel Hierarchical Overlay
Multiplier Architecture Based on Ancient Indian Vedic Mathematics, Transactions on Engineering,
Computing and Technology, Vol. 2.
[29] Rabaey J., Chandrakasan A. and Nikolic B. (2002), Digital Integrated Circuits: A Design Perspective, 2nd
edition, Prentice Hall.
Downloads
Published
Issue
Section
License
Copyright (c) 2020 AUTHOR
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
