M. Best

Bio: M. Best is an academic researcher. The author has contributed to research in topics: Nonlinear programming & Discrete optimization. The author has an hindex of 1, co-authored 1 publications receiving 41 citations.

Optimization of recursive digital filters with finite word lengths

Abstract: The application of the "branch and bound" technique for nonlinear discrete optimization, due to Dakin, to the problem of finding the coefficients of a recursive digital filter with prescribed number of bits, to meet arbitrary response specifications of the magnitude characteristic, is investigated. Due to the fact that the objective function is nonlinear and the stability constraints are linear with respect to the parameter, the recent algorithm for nonlinear programming due to Best and Ritter is used. Based on the ideas presented, a general computer program has been developed. Numerical experience with the present approach is also presented.

Discrete coefficient FIR digital filter design based upon an LMS criteria

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.

Design of optimal finite wordlength FIR digital filters using integer programming techniques

Abstract: The application of a general-purpose integer-programming computer program to the design of optimal finite wordlength FIR digital filters is described. Examples of two optimal low-pass FIR finite wordlength filters are given and the results are compared with the results obtained by rounding the infinite wordlength coefficients. An analysis of the approach based on the results of more than 50 design cases is presented and the problem of optimal wordlength choice is discussed.

Roundoff noise bounds derived from coefficient sensitivities for digital filters

Abstract: The sensitivities of the transfer function of a digital filter with respect to its coefficients are utilized to derive lower bounds on the roundoff noise output in the cases of L_{\infty} and L_{\infty} scaling for fixed-point arithmetic. General bounds are produced which apply to any filter structure if rounding is performed after multiplication and the filter has already been scaled. For the parallel and cascade forms, alternate bounds are derived which apply to rounding after multiplication or summation and which do not require prior scaling. The alternate bounds arethus independent (or nearly so) of pairing, ordering, and transposition. Examples are presented which show that the bounds are reasonably tight.

Design of hardware efficient FIR filter: A review of the state-of-the-art approaches

Abstract: Digital signal processing (DSP) is one of the most powerful technologies which will shape the science, engineering and technology of the twenty-first century Since 1970, revolutionary changes took place in the broad area of DSP which has made it an essential tool in many engineering applications Digital filter is considered to be one of the most important components of almost every DSP sub-systems and therefore a number of extensive works had been carried out by researchers on the design of such filter In order to meet the stringent requirements of filter specification, order of the designed filter is generally assumed to be very large and this leads to high power and area consumption during their implementation As a matter of fact, design of hardware efficient digital filter has drawn enormous attention which needs to be addressed by various useful means One popular approach has been to encode the tap coefficients of such filter in the form of sum of signed powers-of-two and thus the operation of multiplication is substituted by simple addition and shifting This paper presents a detailed review of the basic design approaches applicable for the synthesis of hardware efficient finite duration impulse response (FIR) filter Both the traditional and heuristic search algorithms have been incorporated and properly arranged in this review

Digital circuits and systems

Abstract: This paper is devoted to a brief overview of that part of the area designated in the title which is well within the traditional scope of these TRANSACTIONS, i.e., circuits and systems whose basic description is by signal flow graphs and which can be implemented by digital means. Topics of general and fundamental interest are stressed and important particularities sometimes neglected are included. Main attention is focused on a variety of aspects of constant one-dimensional digital filters. The extension to the multidimensional case is briefly considered, and some further areas are touched upon.