Modified booth algorithm for higher radix fixed-point multiplication

被引：4

作者：

Dawoud, DS ^{[1
]}

机构：

[1] Univ Botswana, Fac Engn, Gaborone, Botswana

来源：

COMSIG '97 - PROCEEDINGS OF THE 1997 SOUTH AFRICAN SYMPOSIUM ON COMMUNICATIONS AND SIGNAL PROCESSING | 1997年

关键词：

D O I：

10.1109/COMSIG.1997.629989

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper the general case of multiplying two fixed length signed numbers using radix r (r greater than or equal to 2) is considered. It is shown that using the standard Booth multiplication algorithm, in such cases, can result in incorrect answer, Correction cycle is required to correct the answer, The function of the correction cycle depends on the radix (r) and the multiplier word length (M). A rule which modifies the algorithm to correct the answer for general r and M is presented.

引用

页码：95 / 100

页数：6