改进混洗蛙跳算法的软硬件划分方法研究

本文将混洗蛙跳算法应用于软硬件划分,提出一种新型的软硬件划分方法。针对混洗蛙跳算法应用于离散型问题时普遍存在的种群更新过慢、算法寻优方向盲目等问题,本文采用随机步长来改进青蛙种群的迁移行为,采用子种群内进化与全局混洗进化相结合的策略改进盲目全局寻优的情况,并根据无效迭代次数来提前终止迭代以提高算法效率。在划分实验中,改进后的算法的平均最优解比原始算法减小了17.4%～73.3%,平均硬件面积比原始算法大对不同结点数的随机DAG图4.32%～5.81%,平均仿真执行时间只有原算法的42.7%～64.0%。改进后算法在寻优能力和收敛速度上均优于原始算法,可更高效地完成软硬件划分任务。      

蛙跳结合模糊C-均值的图像分割算法

实现了基于混合蛙跳与模糊C-均值结合的图像分割算法。克服了由于FCM算法易受初始聚类中心和隶属度矩阵的影响而使图像分割效果不理想的缺陷。蛙跳算法（SFLA）是一种全新的后启发式群体优化算法,具有高效的计算性能和优良的全局搜索能力。实验表明：该方法与FPSO结合既提高了图像分割的效率又能得到更好的图像分割效果。     

A Supervised Constant Modulus Algorithm for Blind Equalization

Blind equalization is a technique for adaptive equalization of a communication channel without the aid of the usual training sequence. Although the Constant Modulus Algorithm (CMA) is one of the most popular adaptive blind equalization algorithms, it suffers from slow convergence rate. A novel enhanced blind equalization technique based on a supervised CMA (S-CMA) is proposed in this paper. The technique is employed to initialize the coefficients of a linear transversal equalizer (LTE) filter in order to provide a fast startup for blind training. It also presents a computational study and simulation results of this newly proposed algorithm compared to other CMA techniques such as conventional CMA, Normalized CMA (N-CMA) and Modified CMA (M-CMA). The simulation results have demonstrated that the proposed algorithm has considerably better performance than others.     

基于改进混合蛙跳算法的SVM分类算法

支持向量机的训练需要求解一个带约束的二次规划问题,但在数据规模很大情况下,经典训练方法将变得很困难。本文提出一种基于改进的混合蛙跳算法的SVM训练算法。针对混合蛙跳算法搜索速度慢且容易陷入局部极值的缺陷,将模拟退火思想引入到混合蛙跳算法中,提出一种改进的混合蛙跳算法。该算法保持了混合蛙跳算法参数少和容易实现的特点,同时通过模拟退火的降温过程来提高算法的进化速度和精度。实验结果表明,该算法能显著提高收敛速度,并能有效克服局部极值,在SVM训练中具有良好效果。     

求解旅行商问题的改进混合蛙跳算法

混合蛙跳算法（Shuffled Frog Leaping Algorithm,SFLA）是解决组合优化问题的有效方法,’但是应用于TSP问题时,由于SFLA没有充分利用最佳个体的优良信息,导致收敛速度太慢。文中把遗传算法（Genetic Algorithm,GA）的交叉和变异引入SFLA,提出了一种针对旅行商问题（Traveling Salesman Problem,TsP）的改进混合蛙跳算法（Improved Shuffled Frog Leaping Al—gorithm,ISFLA）。应用于TSP的实验结果表明：ISFLA的收敛速度明显高于SFLA,同时优于GA和简单翻转算子。ISFLA不仅表现出了更快的收敛速度,而且能有效地缓解局部早熟收敛。     

一种不受信道阶数估计影响的SIMO直接盲均衡算法

针对单输入多输出（Single-Input-Multiple-Output, SIMO）模型提出一种完全不需要信道阶数估计的直接盲均衡算法。文章利用接收数据的截短协方差矩阵和信号子空间的关系设计一种零延迟均衡器,并通过信道矩阵和均衡器系数的合响应特性克服了算法相位偏转的问题,最后得到一种对信道阶数估计鲁棒并且没有相位偏转的盲均衡算法。该算法不同于一般子空间类算法,不需要直接对接收信号的协方差矩阵进行信号子空间和噪声子空间的分解,因此对信道阶数估计具有很强的鲁棒性。文章给出了算法的Batch实现过程,同时为更好适应一般时变信道环境和实现实时处理的要求,通过递归迭代得到算法的自适应实现过程。仿真实验表明该算法几乎不受信道阶数过估计或欠估计的影响,同时该算法具有良好的均方误差（Mean Square Error, MSE）和误符号率SER（Symbol Error Rate, SER）性能,并且具有很快的收敛速度。      

On-line blind multichannel equalization based on mutually referenced filters

This paper presents a novel approach to the blind linear equalization of possibly nonminimum phase and time-varying communication channels. In the context of channel diversity, we introduce the concept of mutually referenced equalizers (MREs) in which several filters are considered, the outputs of which act as training signals for each other. A corresponding (constrained) multidimensional mean-square error (MSE) cost function is derived, the minimization of which is shown to be a necessary and sufficient condition for equalization. The links with a standard linear prediction problem are demonstrated. The proposed technique exhibits properties of important practical concern: 1) the proposed algorithm is globally convergent. 2) Simple closed-form solutions exist for the MREs, but the MREs also lend themselves readily to adaptive implementation. In particular, the recursive least-squares (RLS) algorithm can be used to offer optimal convergence rate. 3) The MRE method provides a solution for all equalization delays, which results in robustness properties with respect to SNR and ill-defined channel lengths.     

CMA算法盲均衡性能分析

由于受多径传输和有限带宽的影响,无线信道不可避免地存在码间干扰和信道间干扰.盲均衡技术是一种不需要训练序列就能补偿信道畸变的新兴自适应均衡技术.文中从Bussgang类盲均衡原理出发,讨论了属于Bussgang类的CMA盲均衡算法,并利用Simulink对算法进行了仿真.从仿真结果可看出步长对算法收敛性能和精度的影响,步长越小,收敛速度越慢,但稳态误差越小;反之亦然.     

基于一种杂交学习算法的自适应复信道均衡技术

本文提出了一种基于多层前馈神经网络杂交学习算法的自适应复信道均衡的新方法。该学习算法用来训练一个输入、输出、权值和激活函数均为复数的神经网络。神经网络的训练利用了监督和非监督相结合的杂交技术,而权值的调整是基于TLS（total least square)准则进行的。计算机仿真结果表明,无论是在线性还是在非线性信道中,所提出的方法都表现出了很好的性能,这为自适应复信道均衡提供了一种新方法。     

Channel equalization using adaptive complex radial basis functionnetworks

It is generally recognized that digital channel equalization can be interpreted as a problem of nonlinear classification. Networks capable of approximating nonlinear mappings can be quite useful in such applications. The radial basis function network (RBFN) is one such network. We consider an extension of the RBFN for complex-valued signals (the complex RBFN or CRBFN). We also propose a stochastic-gradient (SG) training algorithm that adapts all free parameters of the network. We then consider the problem of equalization of complex nonlinear channels using the CRBFN as part of an equalizer. Results of simulations we have carried out show that the CRBFN with the SG algorithm can be quite effective in channel equalization     

Iterative channel estimation for turbo equalization of time-varying frequency-selective channels

We investigate turbo equalization, or iterative equalization and decoding, as a receiver technology for systems where data is protected by an error-correcting code, shuffled by an interleaver, and mapped onto a signal constellation for transmission over a frequency-selective channel with unknown time-varying channel impulse response. The focus is the concept of soft iterative channel estimation, which is to improve the channel estimate over the iterations by using soft information fed back from the decoder from the previous iteration to generate "extended training sequences" between the actual transmitted training sequences.     

Blind equalization by direct examination of the input sequences

This paper presents a novel approach to blind equalization (deconvolution), which is based on direct examination of possible input sequences. In contrast to many other approaches, it does not rely on a model of the approximative inverse of the channel dynamics. To start with, the blind equalization identifiability problem for a noise-free finite impulse response channel model is investigated. A necessary condition for the input, which is algorithm independent, for blind deconvolution is derived. This condition is expressed in an information measure of the input sequence. A sufficient condition for identifiability is also inferred, which imposes a constraint on the true channel dynamics. The analysis motivates a recursive algorithm where all permissible input sequences are examined. The exact solution is guaranteed to be found as soon as it is possible. An upper bound on the computational complexity of the algorithm is given. This algorithm is then generalized to cope with time-varying infinite impulse response channel models with additive noise. The estimated sequence is an arbitrary good approximation of the maximum a posteriori estimate. The proposed method is evaluated on a Rayleigh fading communication channel. The simulation results indicate fast convergence properties and good tracking abilities     

Essential Protein Prediction Based on Shuffled Frog-Leaping Algorithm

Essential proteins are integral parts of living organisms.The prediction of essential proteins facilitates to discover disease genes and drug targets.The prediction precision and robustness of most of existing identification methods are not satisfactory.In this paper,we propose a novel essential proteins prediction method(EPSFLA),which applies Shuffled frog-leaping algorithm(SFLA),and integrates several biological information with network topological structure to identify essential proteins.Specifically,the topological property and several biological properties (function annotation,subcellular localization,protein complex,and orthology) are integrated and utilized to weight protein-protein interaction networks.Then the position of a frog is encoded and denotes a candidate essential protein set.The frog population continuously evolve by means of local exploration and global exploration until termination criteria for algorithm are satisfied.Finally,those proteins contained in the best frog are regarded as predicted essential proteins.The experimental results show that EPSFLA outperforms some well-known prediction methods in terms of various criteria.The proposed method aims to provide a new perspective for essential protein prediction.     

面向服务组合的密码服务调度智能优化研究

为了提高密码服务的质量,提出了一种面向服务组合的密码服务体系结构,并针对其中的密码服务调度问题提出了一种改进的混合离散蛙跳算法。该算法利用传统混合蛙跳算法的基本框架,重新设计了编码和解码方式以及个体矢量更新方法。同时为了提高搜索的精度,利用6种邻域结构,结合变邻域搜索算法,对组内最优青蛙进行优化。最后分别进行了标准算例对比实验与模拟仿真实验,结果验证了算法高效的寻优能力以及合理地实现了服务组合的优化, 满足了用户的需求, 符合现实情况。     

Godard盲均衡算法研究

信道均衡是克服码间干扰的重要措施．但是由于传统的均衡需要发送一训练序列来进行初始抽头系数的调节，这会降低通信中的有效数据传榆率．盲均衡技术的提出就是为了解决这一难题．文中从盲均衡的信号模型入手，对Godard算法进行了研究与仿真，并讨论了其中的几个关键参数．     

用于盲接收的turbo均衡与迭代信道估计

Turbo均衡是一种将信道均衡和差错控制译码联合迭代处理的均衡机制,与传统的均衡器相比,能在更低的信噪比条件下克服严重信道失真导致的符号间干扰(ISI)。该文提出一种用于盲接收的turbo均衡和迭代信道估计方案,不依赖于训练序列或发送符号的先验知识,采用初始盲均衡处理来启动迭代信道估计和turbo均衡。在该方案中,初始盲均衡算法的选择是十分关键的,它需要在恶劣的信道条件为后续迭代处理的启动提供足够的先验信息。该文根据turbo均衡的特点,选择了超指数算法作为初始盲均衡。仿真结果表明,该文提出的用于盲接收的turbo均衡方案是有效的。     

The Derivation of a New Blind Equalization Algorithm

Blind equalization is a technique for adaptive equalization of a communication channel without the aid of training sequences. This paper proposes a new blind equalization algorithm. The advantage of the new algorithm is that it has the lower residual error than the GA (proposed by Godard) and Sign_GA (proposed by Weerackody et al.). The superior performance of the proposed algorithm is illustrated for the 16-QAM signal constellation. A Rummler channel model is assumed as a transmission medium. The performance of the proposed algorithm is compared to the GA, Sign_GA and Stop & Go Algorithm (SGA). The simulation results demonstrate that an improvement in performance is achieved with the proposed equalization algorithm.     

Transmitter redundancy for blind estimation and equalization oftime- and frequency-selective channels

Joint mitigation of time- and frequency-selective fading is an important and challenging problem in mobile communications. Relying on transmitter-induced redundancy, we propose novel channel estimation and symbol recovery approaches for blind identification and equalization of time- and frequency-selective channels, where the time variation is modeled deterministically by a basis expansion. The resulting statistical algorithm enables the usage of a single antenna, dispenses with channel disparity conditions of existing approaches, and allows channel order overestimation. In addition, new deterministic algorithms for generalized OFDM systems are introduced that produce reliable estimates with few data points at high SNR's. Simulations illustrate the approaches developed     

基于改进SFLA-lman神经网络的电离层杂波抑制方法

针对高频地波雷达目标检测中电离层杂波的干扰问题,提出了一种基于改进混合蛙跳算法优化Elman神经网络预测抑制电离层杂波的策略。为解决混合蛙跳算法初始种群分布不均匀、收敛精度低、易陷于局部极值等问题,引入Cubic混沌映射、莱维飞行策略、非线性平衡因子和复制操作,增强种群多样性,提高算法搜索能力。利用改进后的算法和其他算法分别优化Elman神经网络预测抑制模型,结果表明,改进后的算法无论是在收敛精度和稳定性上,还是在临近距离单元电离层杂波的预测抑制上,都取得了显著的提升。在基本保留目标信号的基础上,平均信杂比较原始回波提升18.52 dB,较原始混合蛙跳算法提升1.08 dB,对于电离层杂波的抑制具有较高应用价值。     

Blind channel equalization using chirp modulating signals

This paper addresses the problem of blind channel equalization in the context of digital communications. Recent results have shown that certain operations applied to the source signal at the transmitter help in the blind identification and equalization of the channel at the receiver. In this paper, the baseband data signal is multiplied with a chirp sequence. Exploiting certain structural properties arising from this operation, a batch-type algorithm is obtained for calculating the equalizer's coefficients. Conditions on the chirp sequence parameters are obtained that guarantee an equalization solution. A low-complexity adaptive algorithm is also proposed. Finally, extensive simulations, and comparisons with other well-known blind techniques, illustrate the excellent performance of this algorithm.