Optimization of linear phase FIR filters in dynamically expanding subexpression space
From MaRDI portal
Publication:2269887
DOI10.1007/S00034-009-9114-7zbMATH Open1191.94057OpenAlexW2076678878MaRDI QIDQ2269887FDOQ2269887
Publication date: 12 March 2010
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-009-9114-7
Filtering in stochastic control theory (93E11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank.
- A modular approach to the computation of convolution sum using distributed arithmetic principles
- Use of minimum-adder multiplier blocks in FIR digital filters
- 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
- Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming
Cited In (1)
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 π π
- Title not available (Why is that?) π π
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)