A fast algorithm having a pseudopolynomial run-time and memory requirement in the worst case is developed to generate multiplierless architectures at all wordlengths for constant multiplications in linear DSP transforms. It is also re-emphasised that indefinitely reducing operators for multiplierless architectures is not sufficient to reduce the final chip area. For a major reduction, techniques like resource folding must be used. Simple techniques for improving the results are also presented.
References
-
-
1)
-
Y.C. Lim ,
S.R. Parker
.
Discrete coefficient FIR digital filter design based upon an LMS criteria.
IEEE Trans. Circuits Syst.
,
10 ,
723 -
739
-
2)
-
H. Samueli
.
An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients.
IEEE Trans. Circuits Syst.
,
7 ,
1044 -
1047
-
3)
-
H.L. Garner
.
Number Systems and Arithmetic.
Adv. Comput.
,
131 -
194
-
4)
-
A. Yurdakul ,
G. Du"ndar
.
Multiplierless realization of linear DSP transforms using common two-term expressions.
J. VLSI Signal Process.
,
3 ,
163 -
172
-
5)
-
O. Alkin ,
H. Çağlar
.
Design of efficient M-band coders with linear-phase and perfect reconstruction properties.
IEEE Trans. Acoust. Speech Signal Process.
,
6 ,
1579 -
1590
-
6)
-
A.G. Dempster ,
M.D. Macleod
.
Use of minimum-adder multiplier blocks in FIR digital filters.
IEEE Trans. Circuits. Syst. II, Analog Digit. Signal Process.
,
9 ,
569 -
577
-
7)
-
W.J. Oh ,
Y.H. Lee
.
Implementation of programmable multiplierless FIR filters with powers-of-two coefficients.
IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process.
,
8 ,
553 -
555
-
8)
-
I. Daubechies
.
The wavelet transform, time-frequency localization and signal analysis.
IEEE Trans. Inf. Theory
,
7 ,
961 -
1005
-
9)
-
Mehendale, M., Sherlekar, S.D., Venkatesh, G.: `Synthesis of multiplierless FIR filters with minimum number of additions', Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, 1995, IEEE Computer Society Press, Los Alamitos, CA, USA, p. 668–671.
-
10)
-
A.G. Dempster ,
M.D. Macleod
.
Constant integer multiplication using minimum adders.
IEE Proc., Circuits Devices Syst.
,
5 ,
407 -
413
-
11)
-
Coleman, J.O.: `Cascaded Coefficient Number Systems Lead to FIR Filters of Striking Computational Efficiency', Proceedings of 2001 international IEEE conf. on Electronics, Circuits and Systems, 2–5 September 2001, Malta.
-
12)
-
M. Potkonjak ,
M.B. Srivastava ,
A.P. Chandrakasan
.
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination.
IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.
,
2 ,
151 -
165
-
13)
-
R.I. Hartley
.
Subexpression sharing in filters using canonic signed-digit multipliers.
IEEE Trans. Circuits Syst. II
,
10 ,
677 -
688
-
14)
-
R. Pasko ,
P. Schaumont ,
V. Derudder ,
S. Vernalde ,
D. Durackova
.
A new algorithm for elimination of common subexpressions.
IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.
,
1 ,
58 -
68
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cds_20020408
Related content
content/journals/10.1049/ip-cds_20020408
pub_keyword,iet_inspecKeyword,pub_concept
6
6