The Duo-Multiplication
Summary :
A novel and efficient multiplication algorithm, called "duo-multiplication", is proposed. Two multiplications and the sum of their results are calculated directly, with the same number of operation steps as is required for the conventional single multiplication. The algorithm is derived from adjusting non-zero partial product generation timing in order to interleave one multiplication execution into the other multiplication execution. This timing adjustment is realized by utilizing the fact that any two algebraic numbers in two's complement representation can be transformed into a binary signed digit representation pair, in which the non-zero digits of one number do not overlap with those of the other number, without increasing total word length. As duomultiplication operation is fundamental on digital signal processing, the algorithm adoption doubles signal processing capability of a microprocessor.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E64-E No.5 pp.350-356
- Publication Date
- 1981/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Electronic Circuits
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takao NISHITANI, "The Duo-Multiplication" in IEICE TRANSACTIONS on transactions,
vol. E64-E, no. 5, pp. 350-356, May 1981, doi: .
Abstract: A novel and efficient multiplication algorithm, called "duo-multiplication", is proposed. Two multiplications and the sum of their results are calculated directly, with the same number of operation steps as is required for the conventional single multiplication. The algorithm is derived from adjusting non-zero partial product generation timing in order to interleave one multiplication execution into the other multiplication execution. This timing adjustment is realized by utilizing the fact that any two algebraic numbers in two's complement representation can be transformed into a binary signed digit representation pair, in which the non-zero digits of one number do not overlap with those of the other number, without increasing total word length. As duomultiplication operation is fundamental on digital signal processing, the algorithm adoption doubles signal processing capability of a microprocessor.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_5_350/_p
Copy
@ARTICLE{e64-e_5_350,
author={Takao NISHITANI, },
journal={IEICE TRANSACTIONS on transactions},
title={The Duo-Multiplication},
year={1981},
volume={E64-E},
number={5},
pages={350-356},
abstract={A novel and efficient multiplication algorithm, called "duo-multiplication", is proposed. Two multiplications and the sum of their results are calculated directly, with the same number of operation steps as is required for the conventional single multiplication. The algorithm is derived from adjusting non-zero partial product generation timing in order to interleave one multiplication execution into the other multiplication execution. This timing adjustment is realized by utilizing the fact that any two algebraic numbers in two's complement representation can be transformed into a binary signed digit representation pair, in which the non-zero digits of one number do not overlap with those of the other number, without increasing total word length. As duomultiplication operation is fundamental on digital signal processing, the algorithm adoption doubles signal processing capability of a microprocessor.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - The Duo-Multiplication
T2 - IEICE TRANSACTIONS on transactions
SP - 350
EP - 356
AU - Takao NISHITANI
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 5
JA - IEICE TRANSACTIONS on transactions
Y1 - May 1981
AB - A novel and efficient multiplication algorithm, called "duo-multiplication", is proposed. Two multiplications and the sum of their results are calculated directly, with the same number of operation steps as is required for the conventional single multiplication. The algorithm is derived from adjusting non-zero partial product generation timing in order to interleave one multiplication execution into the other multiplication execution. This timing adjustment is realized by utilizing the fact that any two algebraic numbers in two's complement representation can be transformed into a binary signed digit representation pair, in which the non-zero digits of one number do not overlap with those of the other number, without increasing total word length. As duomultiplication operation is fundamental on digital signal processing, the algorithm adoption doubles signal processing capability of a microprocessor.
ER -
English
