A note on compiling fixed point binary multiplications

Authors:
H. Tim Gladwin
Affiliations:
Univ. of Washington, Seattle
Venue:
Communications of the ACM
Year:
1971

Citing 0
Cited 3

Functions realizable with word-parallel logical and two's-complement addition instructions

Communications of the ACM
Compiling fixed-point multiplications

Communications of the ACM
WHAM: A High-Throughput Sequence Alignment Method

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	48.25

Visualization

Abstract

An algorithm is developed for compiling, as a sequence of shifts, additions, and subtractions, many fixed point binary multiplications involving a constant. The most significant characteristics of the algorithm are the simplicity of the test which determines if the algorithm should be applied and the degree to which it “suggests” efficient object code.