Computation sharing multiplier using redundant binary arithmetic
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,. He has used natural binary (NB) numbers for implementa...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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,. 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. |
---|---|
DOI: | 10.1109/APCCAS.2010.5774869 |