Loading [a11y]/accessibility-menu.js
Computation sharing multiplier using redundant binary arithmetic | IEEE Conference Publication | IEEE Xplore

Computation sharing multiplier using redundant binary arithmetic


Abstract:

Multiplication is the most time consuming computation for digital signal processing algorithm implementation. In a finite impulse response (FIR) filter, for coefficient m...Show More

Abstract:

Multiplication is the most time consuming computation for digital signal processing algorithm implementation. In a finite impulse response (FIR) filter, for coefficient multiplication, Computation sharing multiplier was proposed by Kaushik Roy, [3]. He has used natural binary (NB) numbers for implementation of FIR filter. In the present work, redundant binary (RB) number is used in computation sharing multiplication. The implementation of a 16×16 bit multiplier using RB number is found to be faster than that using NB number system with 130nm technology. This speed advantage comes because of the property of RB arithmetic in which no carry propagation occurs while addition of partial products.
Date of Conference: 06-09 December 2010
Date Added to IEEE Xplore: 27 May 2011
ISBN Information:
Conference Location: Kuala Lumpur, Malaysia

References

References is not available for this document.