2010
DOI: 10.1504/ijsise.2010.038018
|View full text |Cite
|
Sign up to set email alerts
|

Design of two-dimensional recursive digital filters with specified magnitude and group-delay characteristics using Taguchi-based Immune Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 18 publications
0
9
0
Order By: Relevance
“…The performance of HMAPSO was compared with those of HTGA, MEPSO, DE, G3 with PCX, Quasi-Newton, neural networks and the genetic algorithm. Abo-Zahhad et al (2010) proposed the Taguchi-based immune algorithm to design 2-D recursive filters with specified magnitude and group-delay characteristics. Pham and Koc (2010) solved the constrained optimization problem of 2-D recursive filter design using the bees algorithm (BA).…”
Section: Design Techniques Of 2-d Iir Digital Filtersmentioning
confidence: 99%
“…The performance of HMAPSO was compared with those of HTGA, MEPSO, DE, G3 with PCX, Quasi-Newton, neural networks and the genetic algorithm. Abo-Zahhad et al (2010) proposed the Taguchi-based immune algorithm to design 2-D recursive filters with specified magnitude and group-delay characteristics. Pham and Koc (2010) solved the constrained optimization problem of 2-D recursive filter design using the bees algorithm (BA).…”
Section: Design Techniques Of 2-d Iir Digital Filtersmentioning
confidence: 99%
“…This paper presents one of the recently multi-objective evolutionary algorithms to solve the above mentioned problem that is called Immune Algorithm (IA). IA is a randomized algorithm inspired by immune functions and principles observed in nature [8] - [9].…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, the energy consumed in moving the sensor (Ernav) is linear with respect to distance it travelled when acceleration is negligible [12] as given by Equation (8). In our centralized algorithm, each sensor will only move once, so its moved distance equals to the distance between the initial position ( X b yJ and final position (Xj; Yj).…”
Section: Coverage Area Objectivementioning
confidence: 99%
“…The use of mobile sinks can potentially provide energy-efficient data collection with well-designed networking protocols for WSNs [13]. When using the mobile sink in practice, the sink nodes can be attached to vehicles, animals or people that can move inside the region of interest.…”
Section: Introductionmentioning
confidence: 99%