2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2012
DOI: 10.1109/icassp.2012.6288670
|View full text |Cite
|
Sign up to set email alerts
|

Minimax design of sparse FIR digital filters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The global optimal karush kuhn tucker condition for first order at point ƒ are ∆ = ʎ 1 + ʎ 2 = 0 (26) ʎ 1 − ≤ 0 ʎ 2 -+ ≤ 0 (27) where, ʎ 1 and ʎ 2 ʎ 1 ʎ 2 (28) The other karush kuhn condition are also given as below: 1. if < < , which implies that (∇ ) = 0. is the hessian matrix approximation at point k. When karush kuhn tucker condition is satisfied by ∆ = 0. In IFFA, the fireflies position is calculated by using the equation (11). The fitness function corresponding to it is given by = + × ∆ (35) where is the hessian approximation matrix , which produces disruption × ∆ in the fitness .…”
Section: Convergence Of Iffo Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The global optimal karush kuhn tucker condition for first order at point ƒ are ∆ = ʎ 1 + ʎ 2 = 0 (26) ʎ 1 − ≤ 0 ʎ 2 -+ ≤ 0 (27) where, ʎ 1 and ʎ 2 ʎ 1 ʎ 2 (28) The other karush kuhn condition are also given as below: 1. if < < , which implies that (∇ ) = 0. is the hessian matrix approximation at point k. When karush kuhn tucker condition is satisfied by ∆ = 0. In IFFA, the fireflies position is calculated by using the equation (11). The fitness function corresponding to it is given by = + × ∆ (35) where is the hessian approximation matrix , which produces disruption × ∆ in the fitness .…”
Section: Convergence Of Iffo Algorithmmentioning
confidence: 99%
“…The techniques in [10], use linear programming to obtain sparse filters while in [11] sparsity is treated as a specification and tries to minimize least square error through l 1 norm minimization. An iterative design methodology is recommended in [12] to reduce reweighted 'l" norm of the coefficients and another iterative method "second arrange cone programming" is discussed in [13] , these algorithms showed the enhancement over [10] and [11]. In [14], the orthogonal Matching Pursuit (OMP) is utilized in designing linear phase sparse FIR filters.…”
Section: Introductionmentioning
confidence: 99%