数字滤波器设计的文化量子算法

有限脉冲响应(FIR)和无限脉冲响应(IIR)数字滤波器的设计实质可看作是多参数优化问题。为实现高效的数字滤波器,首先将滤波器的设计转化为滤波器参数的约束优化问题,然后提出文化量子(CQ)算法在参数空间进行并行搜索以获得滤波器设计的最优参数值。提出的文化量子算法结合文化原理,在量子种群空间更新中使用了量子旋转门的知识进化机制,是一种可用于实数解优化的快速多维搜索算法。计算机仿真实验表明在对FIR和IIR数字滤波器设计时,文化量子算法的收敛速度和性能都优于粒子群,量子粒子群以及自适应量子粒子群优化等算法,证明了该方法的有效性和优越性。     

基于混沌粒子群优化算法的FIR数字滤波器设计

有限脉冲响应(FIR)数字滤波器的设计,实质上是一个多参数优化问题.将粒子群优化算法与混沌相结合来设计FIR数字滤波器,并用该方法设计了一个高通滤波器.与用Parks-McClellan算法设计得到的高通滤波器进行对比发现,基于混沌粒子群优化算法(CPSO)的FIR滤波器通带波动小,阻带衰减大,从而证明了该算法的有效性和优越性.     

基于改进粒子群优化算法的IIR数字滤波器设计

针对粒子群优化(PSO)算法存在早熟收敛问题,提出了一种改进算法——带有柯西扰动的重分布粒子群优化(RPSO)算法,并应用于IIR数字滤波器的优化设计。RPSO在检测到粒子群早熟收敛时,自动触发粒子重分布机制,帮助粒子逃离局部收敛区域,同时在迭代过程中对种群的全局最优位置施加柯西扰动以保持种群的多样性。仿真实验结果表明,在对IIR数字滤波器设计时,RPSO算法的性能优于粒子群、量子粒子群以及基于混沌变异的粒子群优化等算法。     

基于粒子群算法的数字滤波器优化与仿真

研究数字滤波器优化问题,针对传统算法在数字滤波器优化过程中易出现“早熟”和后期收敛速度慢等等问题,提出了一种动量交叉粒子群算法的数字滤波器优化方法.首先把求解数字滤波器参数的问题数学化为性能指标优化模型,然后采用动量交叉粒子群算法找到符合特征要求的数字滤波器参数值,并通过仿真对性能进行测试.仿真结果表明,动量交叉粒子群算法较好地解决了传统算法的易出现“早熟”和后期收敛速度慢等等难题,设计数字滤波器的频域响应十分逼近理想频域响应,提高数字滤波器的设计效率.     

基于差分文化算法的FIR数字滤波器设计

有限脉冲响应（FIR）数字滤波器的设计实质可看作是多参数优化问题。为高效实现FIR数字滤波器,将滤波器的设计转化为滤波器参数优化问题,然后提出差分文化粒子群（DC）算法在参数空间进行并行搜索以获得滤波器设计的最优参数值。提出的差分文化算法结合文化原理差分演进原理,是一种可用于实数优化的多维搜索算法。计算机仿真实验表明在设计FIR数字滤波器设计时,差分文化算法的收敛速度和性能都优于粒子群,量子粒子群以及自适应量子粒子群优化等算法,证明了该方法的有效性和优越性。     

基于自由搜索算法的IIR数字滤波器设计

无限脉冲响应(IIR)数字滤波器的设计实质上是一个多参数多目标优化问题。针对自由搜索算法原型优化设计时存在后期寻优效率低等缺陷,提出一种改进搜索策略的优化方法。通过动态调整个体的领域搜索半径和定期轴向搜索等策略,提高算法在多维空间的搜索能力。将其应用于IIR数字滤波器的优化设计,并在最小均方误差、最小通带阻带纹波幅值和两者相结合的优化准则下,对参数空间施加适当的约束条件,建立相应的优化模型。仿真结果表明,在设计IIR数字滤波器时,该算法的优化结果优于同类算法。     

FIR数字滤波器的智能优化算法设计综述

对有限冲激响应(Finite Impulse Response,FIR)数字滤波器的智能优化算法进行了归纳和总结,优化算法设计将数字滤波器设计问题转化为误差函数最小化问题,相比传统的设计方法,智能优化算法更易确定通带和阻带的边界频率,降低计算复杂度并且减小幅频响应在通带和阻带上的误差。从收敛速度、通带波纹、阻带衰减等角度分析和比较了遗传算法、进化算法和粒子群算法等在FIR数字滤波器设计上的特点,着重讨论了粒子群算法中惯性权重等参数的改进策略。     

改进的结构进化无限冲激响应数字滤波器设计方法

为了进一步提高无限冲激击响应（IIR）数字滤波器的性能,提出了一种基于结构和参数同时进化的IIR数字滤波器设计方法。首先,通过遗传算法（GA）得到初始滤波器结构;然后,利用差分进化（DE）算法优化滤波器参数;最后,通过动态调整个体搜索步长和双向试探搜索的改进寻优算法对滤波器参数进一步优化,并将该算法用于低通、高通数字滤波器的设计。同基于遗传算法结构进化的IIR滤波器方法相比,继续利用差分进化算法和改进的寻优算法优化乘法器参数得到的低通数字滤波器的通带性能相差不大,但是过渡带宽度减小了65%,阻带最小衰减下降了36.48 dB;得到的高通数字滤波器通带波纹减少了75%,过渡带宽度减小了44%,阻带最小衰减下降了12.13 dB。实验仿真结果表明,所提方法可以获得性能更佳的滤波器,是一种有效可行的IIR数字滤波器的设计方法。     

用改进的GAOT设计数字滤波器

数字滤波器的设计是一个多维变量的寻优问题,但通常存在大量的局部极小点.遗传算法是一个全局优化算法,可以用于滤波器的设计.介绍了遗传算法工具箱(GAOT)并进行分析和改进,用改进的GAOT设计了IIR滤波器,通过仿真结果表明了改进的GAOT在设计IIR滤波器时的有效性.     

粒子群优化算法在FIR数字滤波器设计中的应用

介绍了基于粒子群优化算法的FIR数字滤波器的设计方法,并用该方法设计了一个高通滤波器。与用Parks-McClellan算法设计的高通滤波器进行了对比,发现基于粒子群优化算法的FIR滤波器的通带波动更小,阻带衰减更大。将用这两种算法设计的滤波器作用于混频信号,得出的结果也证明了基于粒子群优化算法的FIR滤波器的有效性。     

AN OPTIMAL DESIGN OF IIR DIGITAL FILTER USING PARTICLE SWARM OPTIMIZATION

In this article, a novel approach for infinite-impulse response (IIR) digital filters using particle swarm optimization (PSO) is presented. IIR filter is essentially a digital filter with recursive responses. Because the error surface of digital IIR filters is generally nonlinear and multimodal, so global optimization techniques are required in order to avoid local minima. This study is based on a heuristic way to design IIR filters. PSO is a powerful global optimization algorithm introduced in combinatorial optimization problems. This study finds the optimum coefficients of the IIR digital filter through PSO. It is found that the calculated values are more optimal than the FDA tool and GA available for the design of the filter in MATLAB. Design of low-pass and high-pass IIR digital filters is proposed in order to provide an estimate of the transition band. The simulation results of the employed examples show an improvement on the transition band. The stability of designed filters is described by the position of Pole-Zeros.     

A swarm intelligence approach to the synthesis of two-dimensional IIR filters

The concept of particle swarms, although initially introduced for simulating human social behaviors, has become very popular these days as an efficient means for intelligent search and optimization. The particle swarm optimization (PSO), as it is called now, does not require any gradient information of the function to be optimized, uses only primitive mathematical operators and is conceptually very simple. This paper investigates a novel approach to the designing of two-dimensional zero phase infinite impulse response (IIR) digital filters using the PSO algorithm. The design task is reformulated as a constrained minimization problem and is solved by a modified PSO algorithm. Numerical results are presented. The paper also demonstrates the superiority of the proposed design method by comparing it with two recently published filter design methods and two other state of the art optimization techniques.     

Digital IIR Filter Design Using Adaptive Simulated Annealing

Chen, S., Istepanian, R., and Luk, B. L., Digital IIR Filter Design Using Adaptive Simulated Annealing, Digital Signal Processing11 (2001) 241–251Adaptive infinite-impulse-response (IIR) filtering provides a powerful approach for solving a variety of practical problems. Because the error surface of IIR filters is generally multimodal, global optimization techniques are required in order to avoid local minima. We apply a global optimization method, called the adaptive simulated annealing (ASA), to digital IIR filter design. An important advantage of the ASA is the simplicity in software programming. Simulation study involving system identification application shows that the proposed approach is accurate and has a fast convergence rate, and the results obtained demonstrate that the ASA offers a viable tool to digital IIR filter design.     

Fixed-point digital IIR filter design using two-stage ensemble evolutionary algorithm

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.     

DESIGN OF TWO-DIMENSIONAL INFINITE IMPULSE RESPONSE RECURSIVE FILTERS USING HYBRID MULTIAGENT PARTICLE SWARM OPTIMIZATION

We incorporate the optimization problem of two-dimensional infinite impulse response (IIR) recursive filters and the optimization methodology of hybrid multiagent particle swarm optimization (HMAPSO) and then apply the resultant optimized IIR filter in image processing for justifying HMAPSO robustness over other algorithm and its role in optimizing real-time situations. The design of the 2-D IIR filter is reduced to a constrained minimization problem whose robust solution is being achieved by a novel and optimal algorithm HMAPSO. This algorithm integrates the deterministic solution by the multiagent system, the particle swarm optimization (PSO) algorithm, and bee decision-making process. All agents search parallel in an equally distributed lattice-like structure to save energy and computational time as done by the bees in their hive selection process. Thus making use of deterministic search, multiagent PSO, and bee, the HMAPSO realizes the purpose of optimization. Experimental results and the application of the designed filters to focusing the defocused image show that the HMAPSO approach provides better upshots than the previous design methods.     

一类离散时变系统的在线无限脉冲响应滤波逆控制

针对一类离散时变系统,提出了一种基于自适应惯性权重合作粒子群（AIW—CPSO）算法的在线尢限脉冲响应（IIR）滤波自适应系统辨识方法,实现零极点实时跟踪的全匹配控制．IIR滤波器可解决有限脉冲响应（FIR）滤波器在辨识时变系统时因其相关矩阵的特征值会无规律变大而被迫离线训练的问题．同时义降低了在线训练所需的权值向量长度,提升了优化与建模效率．本文设计的白适应惯性权重合作粒子群（AIW—CPSO）算法可在传统卡讧子群优化（PSO）算法的基础上更好地解决因选用IIR滤波器所带来的全局优化问题．通过仿真分析可以看出,对十此类离散时变系统,基于在线AIW—CPSO—IIR滤波器的自适应逆控制方法可以快速有效的实现未知对象的在线建模,同时实时跟踪时变系统的特征值变化．     

IIR system identification using cat swarm optimization

Conventional derivative based learning rule poses stability problem when used in adaptive identification of infinite impulse response (IIR) systems. In addition the performance of these methods substantially deteriorates when reduced order adaptive models are used for such identification. In this paper the IIR system identification task is formulated as an optimization problem and a recently introduced cat swarm optimization (CSO) is used to develop a new population based learning rule for the model. Both actual and reduced order identification of few benchmarked IIR plants is carried out through simulation study. The results demonstrate superior identification performance of the new method compared to that achieved by genetic algorithm (GA) and particle swarm optimization (PSO) based identification.