Multiplier blocks using carry-save adders

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 2, Issue , 2004, Pages

  Gustafsson, Oscar ^a   Dempster, Andrew G ^b   Wanhammar, Lars ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DIGITAL SIGNAL PROCESSING; ENERGY UTILIZATION; FIR FILTERS; FREQUENCY MULTIPLYING CIRCUITS; MAPPING; REDUNDANCY;

CARRY-PROPAGATION ADDER (CPA); CARRY-SAVE ADDERS (CSA); MULTIPLE CONSTANT MULTIPLICATION (MCM); POWER CONSUMPTION;

ADDERS;

EID: 4344578593     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D. R. Bull and D. H. Horrocks, "Primitive operator digital filters," IEE Proc. G, vol. 138, pp. 401-412, June 1991.
2. A. G. Dempster and M. D. Macleod, "Use of minimum-adder multiplier blocks in FIR digital filters," IEEE Trans. Circuits Syst. II, vol. 42, pp. 569-577, Sept. 1995.
3. M. Mehendale, S. D. Sherlakar, and G. Vekantesh, "Synthesis of multiplierless FIR filters with minimum number of additions," Proc. IEEE/ACM Int. Conf. Computer-Aided Design, Los Alamitos, CA, 1995, pp. 668-671.
4. M. Potkonjak, M. B. Shrivasta, and A. P. Chandrakasan, "Multiple constant multiplication: Efficient and versatile framework and algorithms for exploring common subexpression elimination," IEEE Trans. Computer-Aided Design, vol. 15, pp. 151-161, Feb. 1996.
5. R. Pasko, P. Schaumont, V. Derudder, S. Vernalde, and D. Durackova, "A new algorithm for elimination of common subexpressions," IEEE Trans. Computer-Aided Design, vol. 18, pp. 58-68, Jan. 1999.
6. A. Yurdakul and G. Dündar, "Multiplierless realization of linear DSP transforms by using common two-term expressions," J. VLSI Signal Processing, vol. 22, pp. 163-172, Sept. 1999.
7. M. Martínez-Peiró, E. Boemo, and L. Wanhammar, "Design of high speed multiplierless filters using a nonrecursive signed common subexpression algorithm," IEEE Trans. Circuits Syst.-II, vol. 49, no. 3, pp. 196-203, Mar. 2002.
8. O. Gustafsson and L. Wanhammar, "A novel approach to multiple constant multiplication using minimum spanning trees," Proc. IEEE Midwest Symp. Circuits Syst., Tulsa, OK, Aug. 4-7, 2002.
9. O. Gustafsson and L. Wanhammar, "ILP modelling of the common subexpression sharing problem," Proc. IEEE Conf. Elec. Circuits Syst., Dubrovnik, Croatia, Sept. 12-15, 2002.
10. T. G. Noll, "Carry-save architectures for high-speed digital signal processing," J. VLSI Signal Processing, vol. 3, pp. 121-140, 1991.
11. M. Martińez-Peiró and L. Wanhammar, "High-speed low-complexity FIR-filter using multiplier block reduction and polyphase decomposition," in Proc. IEEE Int. Symp. Circuits Syst., Geneva, Switzerland, May, 2000.
12. R. Jain, P. Young, and T. Yoshino, "FIRGEN: A computer-aided system for high performance FIR filter integrated circuits," IEEE Trans. Signal Processing, vol. 39, pp. 1655-1668, July 1991.
13. R. A. Hawley, B. C. Wong, T.-J. Lin, J. L. Laskowski, and H. Samueli, "Design techniques for silicon compiler implementations of high-speed FIR digital filters," IEEE J. Solid-State Circuits, vol. 31, pp. 656-667, May 1996.
14. O. Gustafsson, H. Ohlsson, and L. Wanhammar, "Minimum-adder integer multipliers using carry-save adders," Proc. IEEE Int. Symp. Circuits Syst., Sydney, Australia, May 6-9, 2001, vol. II, pp. 709-712.
15. V. A. Bartlett and A. G. Dempster, "Using carry-save adders in low-power multiplier blocks," in Proc. IEEE Int. Symp. Circuits Syst., Sydney, Australia, May 6-9, 2001, vol. IV, pp. 222-225.