Journal ArticleDOI
Discrete coefficient FIR digital filter design based upon an LMS criteria
TLDR
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.read more
Citations
More filters
Journal ArticleDOI
Efficient design of 2-D multiplierless FIR filters by transformation
Soo-Chang Pei,Sy-Been Jaw +1 more
TL;DR: This paper deals with the design of 2-D multiplierless FIR digital filters, where a special class of multiplierless 1-D FIR filters is designed with coefficients which are a sum or difference of power of two.
Journal ArticleDOI
Lower Bound Analysis and Perturbation of Critical Path for Area-Time Efficient Multiple Constant Multiplications
TL;DR: It is shown that the lower bound of critical path delay of MCMs is significantly smaller than that achieved by existing MCM algorithms, and area-time efficient design of MCM blocks can be obtained by using the proposed techniques.
Proceedings ArticleDOI
Efficient structural adder pipelining in transposed form FIR filters
TL;DR: An efficient method for pipelining structural adders using a partially redundant number representation is proposed in this paper and can be doubled while a speedup factor of up to 7 can be achieved with an area overhead of 26.7%.
Journal ArticleDOI
A Lower Bound for the Hardware Complexity of FIR Filters
Alireza Mehrnia,Alan N. Willson +1 more
TL;DR: This work presents a practical approach to derive a lower bound for the minimal hardware budget required for a practical FIR filter realization of a given set of target filter specifications.
Proceedings ArticleDOI
Use of multiplier blocks to reduce filter complexity
TL;DR: Methods that use multiplier blocks to evaluate the coefficients of an FIR filter are shown to be far superior, in terms of the number of adders required, to the use of binary or CSD representation.
References
More filters
Book
Integer programming
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.
Book
Theory and application of digital signal processing
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.
Journal ArticleDOI
Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase
T. Parks,J. McClellan +1 more
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.