Maximal sharing of partial terms in MCM under minimal signed digit representation
作者： E. da Costa , P. Flores , J. Monteiro
DOI: 10.1109/ECCTD.2005.1523033
关键词:
摘要: We propose a new algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. MCM operations are required by many algorithms digital signal processing and have been subject extensive research. Recently, Minimal Signed Digit (MSD) number representation has proposed as an extension to Canonical (CSD) representation. By properly exploiting redundancy MSD representation, hardware implementation can be significantly optimized. The initial described this paper is able perform better search for optimal redundant coefficient representations under than previous methods. However, during its depth adder-steps not considered. present modified version reduce maximum at expense some extra hardware. results show more complex problems our performs approaches, cases obtaining solutions require 25% less
inesc-id.pt 
sci-hub.se 参考文章(10)
Mahesh Mehendale, S. D. Sherlekar, G. Venkatesh, Techniques for low power realization for FIR filters Proceedings of the 1995 conference on Asia Pacific design automation (CD-ROM) - ASP-DAC '95. pp. 72- ,(1995) , 10.1145/224818.224952
H. Samueli, An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients IEEE Transactions on Circuits and Systems. ,vol. 36, pp. 1044- 1047 ,(1989) , 10.1109/31.31347
A.G. Dempster, M.D. Macleod, Use of minimum-adder multiplier blocks in FIR digital filters IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing. ,vol. 42, pp. 569- 577 ,(1995) , 10.1109/82.466647
A. Nannarelli, M. Re, G.C. Cardarilli, Tradeoffs between residue number system and traditional FIR filters international symposium on circuits and systems. ,vol. 2, pp. 305- 308 ,(2001) , 10.1109/ISCAS.2001.921068
H.T. Nguyen, A. Chattejee, Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis IEEE Transactions on Very Large Scale Integration Systems. ,vol. 8, pp. 419- 424 ,(2000) , 10.1109/92.863621
Miodrag Potkonjak, Mani B. Srivastava, Anantha Chandrakasan, Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching design automation conference. pp. 189- 194 ,(1994) , 10.1145/196244.196343
R. Pasko, P. Schaumont, V. Derudder, S. Vernalde, D. Durackova, A new algorithm for elimination of common subexpressions IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 18, pp. 58- 68 ,(1999) , 10.1109/43.739059
Richard I Hartley, None, Subexpression sharing in filters using canonic signed digit multipliers IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing. ,vol. 43, pp. 677- 688 ,(1996) , 10.1109/82.539000
In-Cheol Park, Hyeong-Ju Kang, Digital filter synthesis based on minimal signed digit representation Proceedings of the 38th conference on Design automation - DAC '01. pp. 468- 473 ,(2001) , 10.1145/378239.378564
Techniques for low power realization of FIR filters design automation conference. pp. 447- 450 ,(2002) , 10.1109/ASPDAC.1995.486353