A New Binary Common Subexpression Elimination Method for Implementing Low Complexity FIR Filters
暂无分享,去创建一个
[1] A. Prasad Vinod,et al. A new common subexpression elimination algorithm for implementing low complexity FIR filters in software defined radio receivers , 2006, 2006 IEEE International Symposium on Circuits and Systems.
[2] John G. Proakis,et al. Digital Signal Processing: Principles, Algorithms, and Applications , 1992 .
[4] Powers-of-Two Coefficients. An Improved Search Algorithm for the Design of Multiplierless FIR Filters with , 1989 .
[5] R. Hartley. Subexpression sharing in filters using canonic signed digit multipliers , 1996 .
[6] A. Dempster,et al. Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .
[7] Patrick Schaumont,et al. A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] 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).
[9] Y. Lim,et al. Discrete coefficient FIR digital filter design based upon an LMS criteria , 1983 .
[10] Miodrag Potkonjak,et al. Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching , 1994, 31st Design Automation Conference.
[11] A. Prasad Vinod,et al. On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.