检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海交通大学大规模集成电路研究所,上海200030
出 处:《微电子学》2001年第1期6-9,19,共5页Microelectronics
基 金:美国国家科学基金! (NSF;U .S.A);国际合作项目! (5 978East Asia and Pacific Program - 96 0 2 485 )
摘 要:最大功耗分析对于设计高可靠性的 VLSI芯片是非常重要的。实际中 ,总是在有限的计算时间内获取一个近似最大功耗。文中用遗传算法来选择具有高功耗的输入及内部状态模型 ,对电路进行仿真 ,实现时序电路的最大功耗估算 ;同时 ,实现了基于统计的逻辑模拟最大功耗估计方法。基于 ISCAS89基准时序电路的仿真表明 ,新方法在大规模门数时具有明显的优势 ,估算精度较高。Estimation of maximum power dissipation is important in designing highly reliable VLSI systems However, maximum power estimation for CMOS circuits is essentially a combination optimization problem, which has exponential complexity in the worst case For large-scaled sequential circuits, due to the fact that the sequential relationship between the Primary Inputs and States must be considered, it is more CPU time intensive to exhaustively search for the optimal input patterns to induce maximum power In this paper, a novel approach is proposed to obtain a lower bound of the maximum power consumption using Genetic Algorithm (GA) Experiments with ISCAS-89 benchmark circuits show that our approach generates the lower bound with the quality that cannot be achieved using simulation-based techniques In addition, a Monte Carlo based technique to estimate maximum power dissipation is realized
分 类 号:TN432.02[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15