Research and Advances

A note on compiling fixed point binary multiplications

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.

Advertisement

Author Archives

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved