蝶形运动估计算法及其VLSI实现

视频技术发展要求更高速,更利于硬件实现的运动估计算法.提出了一种蝶形运动估计算法,该算法采用蝶形搜索模板、快速截止技术和运动向量预测技术.该算法较钻石搜索算法提速43.26%-80%,并且图像质量更好.同时,本文采用加法树和片内并行存储器,构建该算法的VLSI实现结构.通过两种数据映射方法(拉丁方映射和4×4块映射),该结构不但解决了快速搜索算法的数据不规则性难题,并且节省了带宽.当系统时钟为27MHz,数据总线为16位,外部存储器带宽要求仅为4.57Mbit/s.比较其它硬件实现结构,该结构采用了更少的处理单元数,更小的缓存单元,但却获得更快的速度和更高的灵活性.     

智能搜索算法求解最大团问题研究

最大团问题MCP（Maximum Clique Problem）在国外得到了广泛的研究,在国内刚起步,是一类NP完全问题。传统的确定性算法不能有效地进行求解。定义了MCP;介绍了使用启发式算法求解MCP的研究进展;综述了几种典型的智能搜索算法;分析了使用这些典型算法求解MCP的基本思想;研究了这些智能算法在求解MCP时的特点及性能。     

一种基于预测的改进的三步搜索算法

基于对运动矢量分布的中心偏向特性研究,结合零运动预判断,提出了一个基于预测的改进的三步搜索算法(PBITSS),有效地提高了运动估计搜索速度并保持较高的搜索精度.实验结果显示,与三步搜索算法(TSS)相比,图像质量和搜索速度都得到了提高,综合性能高于TSS算法.     

A single layer zero skew clock routing in X architecture

With its advantages in wirelength reduction and routing flexibility compared with conventional Manhattan routing, X architecture has been proposed and applied to modern IC design. As a critical part in high-performance integrated circuits, clock network design meets great challenges due to feature size decrease and clock frequency increase. In order to eliminate the delay and attenuation of clock signal introduced by the vias, and to make it more tolerant to process variations, in this paper, we propose an algorithm of a single layer zero skew clock routing in X architecture (called Planar-CRX). Our Planar-CRX method integrates the extended deferred-merge embedding algorithm (DME-X, which extends the DME algorithm to X architecture) with modified Ohtsuki’s line-search algorithm to minimize the total wirelength and the bends. Compared with planar clock routing in the Manhattan plane, our method achieves a reduction of 6.81% in total wirelength on average and gets the resultant clock tree with fewer bends. Experimental results also indicate that our solution can be comparable with previous non-planar zero skew clock routing algorithm. Supported in part by the National Natural Science Foundation of China (Grant No. 60876026), and the Specialized Research Fund for the Doctoral Program of Higher Education (Crant No. 200800030026)     

基于连续消除的正方形-菱形运动估计算法

在基于搜索起点预测和正方形-菱形算法(SDS)的基础上,结合连续消除算法(SEA),提出了一种新的运动估计算法:基于连续消除的正方形.菱形运动估计算法(SEA-SDS).实验结果表明,该算法以比较小的代价取得了与全搜索算法(FS)相当的效果;在搜索次数和精度方面均优于菱形(DS)和正方形-菱形(SDS)快速运动估计算法.     

利用混合粒子群优化算法求解二次分配问题

提出一种求解二次分配问题的混合粒子群优化算法。新算法将遗传算法的交叉策略引入PSO算法中,同时采用禁忌搜索算法作为局部搜索算法。在QAPLIB实例上的实验结果表明,混合算法具有良好的性能。     

基于TS／VDS算法的涤纶短纤维生产调度优化

采用禁忌搜索（ＴＳ）／变深度搜索（ＶＤＳ）混合算法对涤纶短纤维生产调度优化问题进行优化．混合算法通过改变常规ＴＳ算法邻域,采用变深度搜索技术增强了算法寻优能力．某大型石化企业实际数据的实验结果表明,该算法在寻优能力和求解时间上比常规ＴＳ算法更加有效,能够在更短的时间内获得满意解,对于解决多产品多阶段连续生产调度问题具有实用价值．

     

排课模型中的算法分析与设计

排课模型用到了遗传算法和禁忌搜索算法。为了提高遗传算法的局部搜索能力,根据遗传算法和禁忌搜索算法自身的特点,通过分析两者的优势和不足,给出一种将两者混合使用的排课算法。     

基于蚁群算法的泊位调度问题

在集装箱港口的运作中,泊位调试系统是制约集装箱港口降低船舶在港时间和运营成本的主要瓶颈之一。泊位调度的目标就是确定集装箱港口船舶的停靠泊位和停泊时间。将码头看成离散泊位的集合,以船舶的在港时间最短为目标,应用蚁群算法对该问题进行优经研究,在满足各种约束条件的基础上,充分的利用好码头资源。利用蚁群算法的正反馈和并行搜索特点提高解的质量2和稳定性,通过对某集装箱码头的案例分析,说明该算法的有效性和实用性。     

Railway station route searching based on ACA

In the railway station signal system, the route searching algorithm is an important software module to realize the function safety of this system. In the paper, the ant colony algorithm is applied to the railway station route searching. Take the specific station route-the Wangzhai Station route for example to search the shortest route. The ideas of the Wangzhai Station route searching are put forward based on the ant colony algorithm. The implementation steps of it are presented. The control flow of it is proposed. The program is developed, the interface is worked out, and the route controlling is realized to demonstrate its good performance.