scispace - formally typeset
Search or ask a question
Journal Article•DOI•

Discrete coefficient FIR digital filter design based upon an LMS criteria

Yong Lim1, S. Parker1•
01 Oct 1983-IEEE Transactions on Circuits and Systems (IEEE)-Vol. 30, Iss: 10, pp 723-739
TL;DR: In this article, the remaining unquantized coefficients of a FIR linear phase digital filter when one or more of the filter coefficients takes on discrete values are optimized using the least square response error.
Abstract: An efficient method optimizing (in the least square response error sense) the remaining unquantized coefficients of a FIR linear phase digital filter when one or more of the filter coefficients takes on discrete values is introduced. By incorporating this optimization method into a tree search algorithm and employing a suitable branching policy, an efficient algorithm for the design of high-order discrete coefficient FIR filters is produced. This approach can also be used to design FIR filters on a minimax basis. The minimax criterion is approximated by adjusting the least squares weighting. Results show that the least square criteria is capable of designing filters of order well beyond other approaches by a factor of three for the same computer time. The discrete coefficient spaces discussed include the evenly distributed finite wordlength space as well as the nonuniformly distributed powers-of-two space.
Citations
More filters
Journal Article•DOI•
TL;DR: Three new algorithms for the design of multiplier blocks are described: an efficient modification to an existing algorithm, a new algorithm giving better results, and a hybrid of these two which trades off performance against computation time.
Abstract: The computational complexity of VLSI digital filters using fixed point binary multiplier coefficients is normally dominated by the number of adders used in the implementation of the multipliers. It has been shown that using multiplier blocks to exploit redundancy across the coefficients results in significant reductions in complexity over methods using canonic signed-digit (CSD) representation, which in turn are less complex than standard binary representation. Three new algorithms for the design of multiplier blocks are described: an efficient modification to an existing algorithm, a new algorithm giving better results, and a hybrid of these two which trades off performance against computation time. Significant savings in filter implementation cost over existing techniques result in all three cases. For a given wordlength, it was found that a threshold set size exists above which the multiplier block is extremely likely to be optimal. In this region, design computation time is substantially reduced. >

601 citations

Journal Article•DOI•
TL;DR: If the frequency responses of the original ( M + 1) -band filter and its complementary filter are properly masked and recombined, narrow transition-band filter can be obtained and this technique can be used to design sharp low-pass, high- pass, bandpass, and bandstop filters with arbitrary passband bandwidth.
Abstract: If each delay element of a linear phase low-pass digital filter is replaced by M delay elements, an (M + 1) -band filter is produced. The transition-width of this (M + 1) -band filter is 1/M that of the prototype low-pass filter. A complementary filter can be obtained by subtracting the output of the (M + 1) -band filter from a suitably delayed version of the input. The complementary filter is an (M + 1) -band filter whose passbands and stopbands are the stopbands and passbands, respectively, of the original (M + 1) -band filter. If the frequency responses of the original ( M + 1) -band filter and its complementary filter are properly masked and recombined, narrow transition-band filter can be obtained. This technique can be used to design sharp low-pass, high-pass, bandpass, and bandstop filters with arbitrary passband bandwidth.

488 citations

Journal Article•DOI•
TL;DR: In this article, a digital filter with discrete coefficient values selected from the powers-of-two coefficient space is designed using the methods of integer programming, and the frequency responses obtained are shown to be superior to those obtained by simply rounding the coefficients.
Abstract: FIR digital filters with discrete coefficient values selected from the powers-of-two coefficient space are designed using the methods of integer programming. The frequency responses obtained are shown to be superior to those obtained by simply rounding the coefficients. Both the weighted minimax and the weighted least square error criteria are considered. Using a weighted least square error criterion, it is shown that it is possible to predict the improvement that can be expected when integer quadratic programming is used instead of simple coefficient rounding.

451 citations

Journal Article•DOI•
TL;DR: In this article, a new method of designing linear-phase FIR filters is proposed by minimizing a quadratic measure of the error in the passband and stopband, based on the computation of an eigenvector of an appropriate real, symmetric, and positive-definite matrix.
Abstract: A new method of designing linear-phase FIR filters is proposed by minimizing a quadratic measure of the error in the passband and stopband. The method is based on the computation of an eigenvector of an appropriate real, symmetric, and positive-definite matrix. The proposed design procedure is general enough to incorporate both time- and frequency-domain constraints. For example, Nyquist filters can be easily designed using this approach. The design time for the new method is comparable to that of Remez exchange techniques. The passband and stopband errors in the frequency domain can be made equiripple by an iterative process, which involves feeding back the approximation error at each iteration. Several numerical design examples and comparisons to existing methods are presented, which demonstrate the usefulness of the present approach.

357 citations

Journal Article•DOI•
TL;DR: A new solution of the multiple constant multiplication problem based on the common subexpression elimination technique is presented and it is shown that the number of add/subtract operations can be reduced significantly this way.
Abstract: The problem of an efficient hardware implementation of multiplications with one or more constants is encountered in many different digital signal-processing areas, such as image processing or digital filter optimization. In a more general form, this is a problem of common subexpression elimination, and as such it also occurs in compiler optimization and many high-level synthesis tasks. An efficient solution of this problem can yield significant improvements in important design parameters like implementation area or power consumption. In this paper, a new solution of the multiple constant multiplication problem based on the common subexpression elimination technique is presented. The performance of our method is demonstrated primarily on a finite-duration impulse response filter design. The idea is to implement a set of constant multiplications as a set of add-shift operations and to optimize these with respect to the common subexpressions afterwards. We show that the number of add/subtract operations can be reduced significantly this way. The applicability of the presented algorithm to the different high-level synthesis tasks is also indicated. Benchmarks demonstrating the algorithm's efficiency are included as well.

297 citations

References
More filters
Book•
01 Jan 1972
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Abstract: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization. This highly respected and much-cited text, a standard of graduate-level courses since 1972, presents a comprehensive treatment of the first two decades of research on integer programming.

4,336 citations

Book•
01 Jan 1975
TL;DR: Feyman and Wing as discussed by the authors introduced the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts.
Abstract: sprightly style and is interesting from cover to cover. The comments, critiques, and summaries that accompany the chapters are very helpful in crystalizing the ideas and answering questions that may arise, particularly to the self-learner. The transparency in the presentation of the material in the book equips the reader to proceed quickly to a wealth of problems included at the end of each chapter. These problems ranging from elementary to research-level are very valuable in that a solid working knowledge of the invariant imbedding techniques is acquired as well as good insight in attacking problems in various applied areas. Furthermore, a useful selection of references is given at the end of each chapter. This book may not appeal to those mathematicians who are interested primarily in the sophistication of mathematical theory, because the authors have deliberately avoided all pseudo-sophistication in attaining transparency of exposition. Precisely for the same reason the majority of the intended readers who are applications-oriented and are eager to use the techniques quickly in their own fields will welcome and appreciate the efforts put into writing this book. From a purely mathematical point of view, some of the invariant imbedding results may be considered to be generalizations of the classical theory of first-order partial differential equations, and a part of the analysis of invariant imbedding is still at a somewhat heuristic stage despite successes in many computational applications. However, those who are concerned with mathematical rigor will find opportunities to explore the foundations of the invariant imbedding method. In conclusion, let me quote the following: "What is the best method to obtain the solution to a problem'? The answer is, any way that works." (Richard P. Feyman, Engineering and Science, March 1965, Vol. XXVIII, no. 6, p. 9.) In this well-written book, Bellman and Wing have indeed accomplished the task of introducing the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts.

3,249 citations

Journal Article•DOI•
TL;DR: An efficient procedure for the design of finite-length impulse response filters with linear phase is presented, which obtains the optimum Chebyshev approximation on separate intervals corresponding to passbands and/or stopbands.
Abstract: An efficient procedure for the design of finite-length impulse response filters with linear phase is presented. The algorithm obtains the optimum Chebyshev approximation on separate intervals corresponding to passbands and/or stopbands, and is capable of designing very long filters. This approach allows the exact specification of arbitrary band-edge frequencies as opposed to previous algorithms which could not directly control pass- and stopband locations and could only obtain (N - 1)/2 different band-edge locations for a length N low-pass filter, for fixed \delta_{1} and \delta_{2} . As an aid in practical application of the algorithm, several graphs are included to show relations among the parameters of filter length, transition width, band-edge frequencies, passband ripple, and stopband attenuation.

806 citations

Book•
01 Jan 1964

239 citations