Abstract: This chapter discusses binary multiplication. The shift-and-add technique is explained in the chapter. Multiplications can be performed using a “shift-and-add” technique based on the generation of intermediate results called partial products. Using this algorithm, a partial product is generated for each bit in the multiplier. The shift-and-add approach can be implemented in hardware or software. The chapter also discusses signed binary multiplication and subroutine examples.
Publication Year: 1998
Publication Date: 1998-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot