Fixed-point digital IIR filter design using two-stage ensemble evolutionary algorithm
Fixed-point digital IIR filter design using two-stage ensemble evolutionary algorithm
复制标题
DOI：
10.1016/j.asoc.2012.09.004
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Bin Li;Yu Wang;Thomas Weise;Long Long-Long
中科院分区：
文献类型：
--
作者：
Bin Li;Yu Wang;Thomas Weise;Long Long-Long
近年来，基于各种优化技术（包括进化算法）的无限冲激响应（IIR）滤波器优化设计研究受到了广泛关注。以前，数字IIR滤波器的参数是用浮点表示法编码的。众所周知，定点表示可以有效地节省计算资源，并且更便于直接在硬件上实现。与浮点表示相比，不动点表示会使搜索空间丢失大量有用的梯度信息，从而对连续进化算法提出了新的挑战。在本文中，我们首先分析了最佳数字IIR滤波器设计的适应度景观属性。在适应度景观研究的基础上，将两阶段集成进化算法（TEEA）应用于定点表示的数字IIR滤波器设计。为了充分评估TEEA的性能，我们在四种不同设置的数字IIR滤波器上将其与五种最先进的EA进行了实验比较。实验结果表明，TEEA算法具有收敛速度快、搜索效果好、成功率高等优点。为了进一步对TEEA进行基准测试，我们将其应用于一些更困难的问题，这些问题具有更短的字长或更高阶。我们可以发现，TEEA也可以在这些困难的任务上提供令人满意的性能。
The research on optimal design of infinite-impulse response (IIR) filter design based on various optimization techniques, including evolutionary algorithms (EAs), has gained much attention in recent years. Previously, the parameters of digital IIR filters are encoded with floating-point representations. It is known that a fixed-point representation can effectively save computational resources and is more convenient for direct realization on hardware. Inherently, compared with the floating-point representation, the fixed-point representation would make the search space miss much useful gradient information and therefore, surely rises new challenges for continuous EAs. In this paper, we first analyze the fitness landscape properties of optimal digital IIR filter design. Based on the fitness landscape investigation, a two-stage ensemble evolutionary algorithm (TEEA) is applied to digital IIR filter design with fixed-point representation. In order to fully evaluate the performance of TEEA, we experimentally compare it with five state-of-the-art EAs on four types of digital IIR filters with different settings. Based on the experimental results, we can conclude that TEEA has higher convergence speed, better exploration, and higher success rate. In order to benchmark TEEA further, we apply it to some more difficult problems with shorter word length or higher order. We can find that TEEA can provide satisfying performance on these hard tasks as well.