检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:WANG Shaoxi FAN Xiaoya ZHANG Shengbing HAN Ru
机构地区:[1]School of Software and Microelectronics, Northwestern Polytechnical University
出 处:《Chinese Journal of Electronics》2014年第1期65-69,共5页电子学报(英文版)
基 金:supported by the Natural Science Foundation of Shaanxi(No.2012JQ8048);Basic Research Foundation of Northwestern Polytechnical University(No.JC20110232);Science and Technology Development Program of Shaanxi Province(No.2013K07-04)
摘 要:To satisfy the requirements of complex and special analog layout constraints, a constraint symbolization method based on geometric programming for analog layout retargeting is presented in this paper. Our approach is to build symbolic template for layouts, then uses Geometric programming(GP) to achieve new technology design rules, implement device symmetry and matching constraints, and manage parasitics optimization. The GP,a class of non-linear optimization problem, can be transferred or fitted into a convex optimization problem. Therefore, a global optimum solution can be achieved. The symbolization method ensures the layout retargeting automatically. The efficiency and effectiveness of the proposed algorithm, as compared with the other existing methods, are demonstrated by a basic case-study example and a twostage Miller-compensated operational amplifier.To satisfy the requirements of complex and special analog layout constraints, a constraint symboliza- tion method based on geometric programming for analog layout retargeting is presented in this paper. Our ap- proach is to build symbolic template for layouts, then uses Geometric programming (GP) to achieve new technology design rules, implement device symmetry and matching constraints, and manage parasitics optimization. The GP, a class of non-linear optimization problem, can be trans- ferred or fitted into a convex optimization problem. There- fore, a global optimum solution can be achieved. The sym- bolization method ensures the layout retargeting automati- cally. The efficiency and effectiveness of the proposed algo- rithm, as compared with the other existing methods, are demonstrated by a basic case-study example and a two- stage Miller-compensated operational amplifier.
关 键 词:Constraint symbolization Geometricprogramming Layout Retargeting.
分 类 号:TN45[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40