On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods

The most computationally intensive part of a wideband receiver is the channelizer. The computational complexity of linear phase finite impulse response (LPFIR) filters employed in the channelizer is dominated by the number of adders used in the implementation of the multipliers. In this paper, two methods are proposed to efficiently implement the channel filters in a wideband receiver based on common subexpression elimination (CSE). We exploit the fact that a significant amount of redundant multiplications exist in the filter-bank channelizer as it extracts multiple narrowband channels from the wideband signal. By forming three and four nonzero-bit super-subexpressions utilizing redundant identical shifts that exist between a two- nonzero-bit common subexpression (CS) and a third nonzero bit, or between two nonzero-bit CS, the number of adders to implement the channel filters can be reduced considerably. Furthermore, the complexity of the adders is analyzed and design examples of the channel filters employed in the digital advanced mobile phone system (D-AMPS) and the personal digital cellular (PDC) channelizers show that the proposed methods offer considerable reduction in the number of full adders when compared to conventional CSE methods.

[1]  Robert A. Walker,et al.  A Survey of high-level synthesis systems , 1991 .

[2]  David Bull,et al.  Primitive operator digital filters , 1991 .

[3]  John G. Proakis,et al.  Digital Signal Processing: Principles, Algorithms, and Applications , 1992 .

[4]  Miodrag Potkonjak,et al.  Critical Path Minimization Using Retiming and Algebraic Speed-Up , 1993, 30th ACM/IEEE Design Automation Conference.

[5]  Miodrag Potkonjak,et al.  Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching , 1994, 31st Design Automation Conference.

[6]  Miodrag Potkonjak,et al.  Optimizing power using transformations , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[8]  Joseph Mitola,et al.  The software radio architecture , 1995, IEEE Commun. Mag..

[9]  G. Venkatesh,et al.  Synthesis of multiplier-less FIR filters with minimum number of additions , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[10]  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..

[11]  Nobuo Fujii,et al.  Fast FIR Digital Filter Structures Using Minimal Number of Adders and Its Application to Filter Design (Special Section on Digital Signal Processing) , 1996 .

[12]  R. Hartley Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[13]  Patrick Schaumont,et al.  Optimization method for broadband modem FIR filter design using common subexpression elimination , 1997, Proceedings. Tenth International Symposium on System Synthesis (Cat. No.97TB100114).

[14]  N. Spencer An overview of digital telephony standards , 1998 .

[15]  Joseph Mitola,et al.  Software radio architecture: a mathematical perspective , 1999, IEEE J. Sel. Areas Commun..

[16]  Patrick Schaumont,et al.  A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Ravinder David Koilpillai,et al.  Software radio issues in cellular base stations , 1999, IEEE J. Sel. Areas Commun..

[18]  Youngbeom Jang,et al.  Low-power CSD linear phase FIR filter structure using vertical common sub-expression , 2002 .

[19]  L. Wanhammar,et al.  Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm , 2002 .