http://iet.metastore.ingenta.com
1887

Technique for performing multiplication on a 16-bit microprocessor using an extension of Booth's algorithm

Technique for performing multiplication on a 16-bit microprocessor using an extension of Booth's algorithm

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Multiplication of a 2's-complement number by a known coefficient is often required in digital signal processing and other applications. When this is required to be performed on a microprocessor, an extension of Booth's algorithm (e.b.a.) can be used. Examples are presented to demonstrate how the multiplication is performed using e.b.a. on a microprocessor, and comparisons are made with the machine multiply instruction (m.m.i.) which show that the e.b.a. can take significantly less machine time.

References

    1. 1)
      • L.R. Rabiner , Bernard Gold . Theory and Applications of Digital Signal Processing.
    2. 2)
      • Intel, `MCS-86 Users' Manual', July 1978.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19800040
Loading

Related content

content/journals/10.1049/el_19800040
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address