In mathematics, multiplication is the most commonly used operation. Though integer multiplication is used commonly in the real world, binary multiplication is the basic multiplication used for the integer multiplication. Systolic and Booth algorithms are the efficient algorithms to perform the binary multiplication. In this paper, an attempt is made to implement the prototype of binary multiplier using Booth algorithm (for signed number) and the systolic array multiplication algorithm (for unsigned number). This is implemented using Xilinx ISE6 software, simulated using Modelsim XE 5.5a Simulator by Mentor graphics. The synthesis is done on Field Programmable Gate Array (FPGA) Spartan2S15 kit using Very High Sp eed Integrated Circuit (VHSIC) Hardware Description Language (VHDL). The results are compared with the standard results of the paper presented at Peneng, Malaysia with the publication number ICSE2002 Proc.

1. Index of /mca_course/kurukshetra_university: http://www.onlinemca.com/mca_course/kurukshetra_universi ty/semester1/computerorganization/booth's_multiplication.php
2. http://www.google.co.in/#hl=en&biw=1024&bih=677&saX& ei=7MDATZaDHI6HrAeOltDqAw&ved=0CBgQvwUoq=syst olic+array+multiplier+serial+to+parallel+multiplier&spel l=1&fp=bdd9097c9b58ade7.
3. BinaryEssence: www.binaryessence.com/dot/en00041.htm.
4. Douglas .L. Perry. 2002. VHDL Programming by Example 4th Edition,Tata McGraw Hill.
5. Saunders,l.,1987.The IBM VHDL Design system , Proc.24th design automation conference.
6. Lakshmanan ,Masuri Othman and Mohamad Alauddin Mohd. Ali,”High performance parallel multiplier using Wallace- Booth algorithm”, paper published by ICSE Proc, 2002, Peneng, Malaysia.

Booth algorithm Systolic algorithm