Abstract:
Multi-operand associative techniques attain their full power in algorithms Where the data may be recast into disjoint data sets, all acted upon concurrently, each by a di...Show MoreMetadata
Abstract:
Multi-operand associative techniques attain their full power in algorithms Where the data may be recast into disjoint data sets, all acted upon concurrently, each by a different operand common to the set. But the multi-operand approach can also serve to enhance arithmetic operations significantly. The speed-up of associative multiplication by handling a number of multiplier bits at a time is described and analyzed, including an effective algorithm for a limited sum of products. The most complex process treated is convolution, which serves to illustrate the enhancement of an extended sum of products. Any number of vectors stored in memory can be convolved simultaneously by a common filter vector. Execution time is 45 milliseconds for 1024 element data and filter vectors, 2048 element results, and l6-bit precision.
Published in: 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH)
Date of Conference: 20-22 June 1983
Date Added to IEEE Xplore: 27 February 2012
Print ISBN:0-8186-0034-9