In designing discrete-time filters, the length of the impulse response is often used as an
indication of computational cost. In systems where the complexity is dominated by arithmetic …

Sparse FIR filters have lower implementation complexity than full filters, while kee** a
good performance level. This paper describes a new method for designing 1D and 2D …

In this paper, we propose a novel algorithm for sparse finite impulse response (FIR) filter
designs. The objective of the sparse digital filter design problem considered in this paper is …

This paper considers three problems in sparse filter design, the first involving a weighted
least-squares constraint on the frequency response, the second a constraint on mean …

A new method to reduce the number of multipliers in the design of sharp FIR filters by
frequency-response masking technique is presented. The success of the proposed method …

We consider the problem of designing a sparse FIR filter and show that it can be cast into a
problem of determining a sparse solution of a linear system of equations. Previously …

Digital filters in cascade form enjoy many advantages over their equivalent single-stage
realizations in that lower coefficient sensitivity, higher throughput, reduced computational …

This paper focuses on the design of multiplier-less decimation filters suitable for
oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization …

Branch-and-bound algorithm is applied to the design of sparse FIR filters having
intentionally zeroed tap positions. It is shown that this algorithm coupled with a suitable …

An optimization problem for designing a nonuniformly spaced linear-phase FIR filter with
minimal complexity is formulated and solved by mixed integer linear programming (MILP) …