Optimization of linear phase FIR filters in dynamically expanding subexpression space
From MaRDI portal
(Redirected from Publication:2269887)
Recommendations
- Performance of CSE techniques for designing multiplier-less FIR filter using evolutionary algorithms
- Minimizing design costs of an FIR filter using a novel coefficient optimization algorithm
- An efficient algorithm for the optimization of FIR filters synthesized using the multistage frequency-response masking approach
- A method for synthesizing multiplierless FIR digital filters with narrow transition widths
- scientific article; zbMATH DE number 2247862
Cites work
- A modular approach to the computation of convolution sum using distributed arithmetic principles
- A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank.
- Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming
- Discrete coefficient FIR digital filter design based upon an LMS criteria
- Multiplierless multiple constant multiplication
- Roundoff Noise Analysis of Signals Represented Using Signed Power-of-Two Terms
- Use of minimum-adder multiplier blocks in FIR digital filters
Cited in
(7)- New protection technique against unidirectional MEUs for FIR filters
- Efficient computation of multiplierless filters in embedded systems employing an optimal approximation method
- Algebraic methods for optimizing constant multiplications in linear systems
- Minimizing design costs of an FIR filter using a novel coefficient optimization algorithm
- Integer linear programming-based bit-level optimization for high-speed FIR decimation filter architectures
- Performance of CSE techniques for designing multiplier-less FIR filter using evolutionary algorithms
- scientific article; zbMATH DE number 2135409 (Why is no real title available?)
This page was built for publication: Optimization of linear phase FIR filters in dynamically expanding subexpression space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269887)