Scholars Central

Research articlePublished May 2012

ZOUST FOR SUPREMECY-BOOTH’S & BKS MULTIPLICATION ALGORITHM

Authors: Barun Biswas, Krishnendu Basuli, Samar Sen Sarma

Journal of Global Research in Computer Sciences

Volume 3 · Issue 5 · Pages 19–68

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Global Research in Computer Sciences.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Global Research in Computer Sciences
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Barun Biswas”
  • BylineArticles whose byline prints “Krishnendu Basuli”
  • BylineArticles whose byline prints “Samar Sen Sarma”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels