Barun Biswas, Krishnendu Basuli and Samar Sen Sarma
The aroma of multiplication algorithm is ever lasting. It is due to time, space and cost effective as well as number representation. We study here that given a multiplier whether we will take one bit, two bit, three bit or in general n bit for multiplicative realization. Since initial inspiration is Booth’s algorithm[1] we consider an interesting aberration of Booth’s multiplication algorithm in this paper called BKS(named after the author Barun Biswas, Krishnendu Basuli & Samar Sen Sarma). The BKS algorithm surpasses Booth’s algorithm with minimum cost.
English 
Spanish 
Chinese 
Russian 
French 
Japanese 
Portuguese 
Hindi