Techniques for avoiding sign-extension in multiple constant multiplication

Authors:
Oscar Gustafsson;Kenny Johansson;Linda S. DeBrunner
Affiliations:
Department of Electrical Engineering, Linköping University, Linköping, Sweden;Department of Electrical and Computer Engineering, Florida State University, Tallahassee;Department of Electrical and Computer Engineering, Florida State University, Tallahassee
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 5
Cited 0

Multiplierless multiple constant multiplication

ACM Transactions on Algorithms (TALG)
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A new algorithm for elimination of common subexpressions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A graph theoretic approach for synthesizing very low-complexity high-speed digital filters

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we consider three different techniques for avoiding sign-extension in constant multiplication based on shifts, additions, and subtraction. Especially, we consider the multiple constant multiplication (MCM) problem arising in transposed direct form FIR filters. The main advantage of avoiding sign-extension is the reduced load of the sign-bits. Furthermore, the complexity is slightly reduced as full adders are replaced by half adders or full adders with one constant one input. The proposed techniques can be applied independent of which algorithm was used to solve the MCM problem.