A new contention resolution algorithm for the design of minimal logic depth multiplierless filters
暂无分享,去创建一个
[1] H. Samueli,et al. Design techniques for silicon compiler implementations of high-speed FIR digital filters , 1996 .
[2] Patrick Schaumont,et al. A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[3] Y. Lim,et al. Discrete coefficient FIR digital filter design based upon an LMS criteria , 1983 .
[4] Miodrag Potkonjak,et al. Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] A. Dempster,et al. Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .
[6] L. Wanhammar,et al. Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm , 2002 .
[7] H. Samueli. The design of multiplierless digital data transmission filters with powers-of-two coefficients , 1990, SBT/IEEE International Symposium on Telecommunications.
[8] David Bull,et al. Primitive operator digital filters , 1991 .
[9] Hyeong-Ju Kang,et al. Digital filter synthesis based on minimal signed digit representation , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[10] R. Hartley. Subexpression sharing in filters using canonic signed digit multipliers , 1996 .