期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
或符合全展开式的分解转换算法 认领 引用 被引量:2
1
作者 杨萌 周学功 +2 位作者 唐璞山 童家榕 A.E.A. Almaini 《计算机辅助设计与图形学学报》 EI 北大核心 2009年第7期998-1004,共7页
针对现有算法在处理多变量实际电路时间开销较大的问题,提出或符合全展开式的分解转换算法.cj最大项展开式和dj最大项展开式在相同极性下两者之间存在转换矩阵,而矩阵运算复杂度较高,把矩阵的运算简化成与和非的位运算,从而大量地节省... 针对现有算法在处理多变量实际电路时间开销较大的问题,提出或符合全展开式的分解转换算法.cj最大项展开式和dj最大项展开式在相同极性下两者之间存在转换矩阵,而矩阵运算复杂度较高,把矩阵的运算简化成与和非的位运算,从而大量地节省了运算时间;在此基础上,将cj最大项展开式分解到不同的分组中,提出了分解算法,避免了矩阵的重复计算,再次缩短了计算时间.为了避免cj最大项展开式中过多最大项而造成转化时间开销增加,还提出了基于cj最小项的分解算法.实验结果表明,包含算法适用于处理小变量,但在处理多变量时时间开销增大,而采用了分解算法后,可极大减少转换时间开销. 展开更多
关键词 逻辑综合 或符合展开式 Reed-Muller展开式
暂未订购 下载PDF
FPGA PLACEMENT OPTIMIZATION BY TWO-STEP UNIFIED GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM 认领 引用 被引量:6
2
作者 Yang Meng A.E.A. Almaini Wang Pengjun 《Journal of Electronics(China)》 2006年第4期632-636,共5页
Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it... Genetic Algorithm (GA) is a biologically inspired technique and widely used to solve numerous combinational optimization problems. It works on a population of individuals, not just one single solution. As a result, it avoids converging to the local optimum. However, it takes too much CPU time in the late process of GA. On the other hand, in the late process Simulated Annealing (SA) converges faster than GA but it is easily trapped to local optimum. In this letter, a useful method that unifies GA and SA is introduced, which utilizes the advantage of the global search ability of GA and fast convergence of SA. The experimental results show that the proposed algorithm outperforms GA in terms of CPU time without degradation of performance. It also achieves highly comparable placement cost compared to the state-of-the-art results obtained by Versatile Place and Route (VPR) Tool. 展开更多
关键词 Genetic Algorithm (GA) Simulated Annealing (SA) Placement FPGA EDA
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈