检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:ZHANG Huihong WANG Pengjun GU Xingsheng
机构地区:[1]Institution of Automation, East China University of Science and Technology, Shanghai 200237, China [2]Institute of Circuits and Systems, Ningbo University, Ningbo 315211, China
出 处:《Chinese Journal of Electronics》2011年第1期27-30,共4页电子学报(英文版)
基 金:This work is supported by the National Natural Science Foundation of China (No.60776022), the Postdoctoral Science Foundation of China (No.20090461355), the Postdoctoral Research Projects of Zhejiang Province, the Scientific Research Fund of Zhejiang Provincial Education Department (No.Y200803880), the Subject Fund of Ningbo University (No.xk109102).
摘 要:A novel niche genetic algorithm is proposed for area optimization of fixed-polarity Reed-Muller circuits, which may have more than one best polarity. In the algorithm, the niche sources are allocated to a specific number of the most excellent candidates; the niche radius is adjusted according to the real-time information of the evolving process; a flexible memory pool is employed to keep the possibly existed numerous best polarities. Experimental results of eight MCNC benchmark circuits show that the proposed algorithm is superior to the traditional genetic algorithm and the basic clearing algorithm in global searching ability, especially for multi optimal polarities searching.
关 键 词:Fixed-polarity RM circuit Area optimization Niche technique.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249