Non-convex optimization for the design of sparse FIR filters
This paper presents a method for designing sparse FIR filters by means of a sequence of p-norm minimization problems with p gradually decreasing from 1 toward 0. The lack of convexity for p < 1 is partially overcome by appropriately initializing each subproblem. A necessary condition of optimalit...
Main Author: | Wei, Dennis |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/58829 |
Similar Items
-
Sparse FIR Filter Design Based on Simulated Annealing Algorithm
by: WU, C., et al.
Published: (2015-02-01) -
Design of Sparse FIR Filters with Low Group Delay
by: Jacek Konopacki
Published: (2021-02-01) -
Transformations for FIR and IIR Filters’ Design
by: V. N. Stavrou, et al.
Published: (2021-03-01) -
Overview of intelligent optimization algorithm design of FIR digital filter
by: Zhang Shuyu, et al.
Published: (2021-05-01) -
A new design methodology for window‐based FIR filters
by: R. Avanzato, et al.
Published: (2023-06-01)