The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Digital IIR Filter Design Using Differential Evolution Algorithm
Open accessAbstract
Any digital signal processing algorithm or processor can be reasonably described as a digital filter. The main advantage of an infinite impulse response (IIR) filter is that it can provide a much better performance than the finite impulse response (FIR) filter having the same number of coefficients. However, they might have a multimodal error surface. Differential evolution (DE) algorithm is a new heuristic approach mainly having three advantages; finding the true global minimum of a multimodal search space regardless of the initial parameter values, fast convergence, and using a few control parameters. In this work, DE algorithm has been applied to the design of digital IIR filters and its performance has been compared to that of a genetic algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
On the performance of artificial bee colony (ABC) algorithm
Karaboga, D., & Basturk, B. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.05.007 · Cited by 3,672
A new design method based on artificial bee colony algorithm for digital IIR filters
Karaboga, N. (2009) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2008.11.003 · Cited by 556
Self-citationAn improved differential evolution algorithm and its application in optimization problem
Deng, W., Shang, S., Cai, X., Zhao, H., Song, Y., & Xu, J. (2021) · Soft Computing · doi:10.1007/s00500-020-05527-x · Cited by 383
Nabavi, S. S., Gill, S. S., Xu, M., Masdari, M., & Garraghan, P. (2022) · International Journal of Communication Systems · doi:10.1002/dac.4747 · Cited by 35
Metadata
- Authors
- Karaboga, N.
- Venue
- EURASIP Journal on Advances in Signal Processing
- Published
- 2005-05-31
- Volume
- 2005
- Issue
- 8
- ISSN
- 1110-8657 (ISSN-L)
- 1687-6180
- OpenAlex
- W2141995376
- Cited by
- 211
- References
- 1
- FWCI
- 8.29
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.