A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法)
针对library-free映射过程中常用的动态规划算法在求解大电路时覆盖时间过长的问题，提出了一种将动态规划与遗传算法相结合的混合优化算法，用于平衡求解速度和求解质量，并利用“与/或/非”图和逻辑努力实现基于MOS晶体管的电路的面积估算.MCNC电路的测试结果显示，相较于动态规划，混合算法求得的最优解在面积平均增加不到1%的情况下，求解时间可节省35%以上....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2018-11-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2018.06.015 |
| _version_ | 1797235763382845440 |
|---|---|
| author | YUQi(喻奇) WANGLunyao(王伦耀) XIAYinshui(夏银水) |
| author_facet | YUQi(喻奇) WANGLunyao(王伦耀) XIAYinshui(夏银水) |
| author_sort | YUQi(喻奇) |
| collection | DOAJ |
| description | 针对library-free映射过程中常用的动态规划算法在求解大电路时覆盖时间过长的问题，提出了一种将动态规划与遗传算法相结合的混合优化算法，用于平衡求解速度和求解质量，并利用“与/或/非”图和逻辑努力实现基于MOS晶体管的电路的面积估算.MCNC电路的测试结果显示，相较于动态规划，混合算法求得的最优解在面积平均增加不到1%的情况下，求解时间可节省35%以上. |
| first_indexed | 2024-04-24T16:53:08Z |
| format | Article |
| id | doaj.art-12e55dbee70545c595bf9930792f2902 |
| institution | Directory Open Access Journal |
| issn | 1008-9497 |
| language | zho |
| last_indexed | 2024-04-24T16:53:08Z |
| publishDate | 2018-11-01 |
| publisher | Zhejiang University Press |
| record_format | Article |
| series | Zhejiang Daxue xuebao. Lixue ban |
| spelling | doaj.art-12e55dbee70545c595bf9930792f29022024-03-29T01:58:38ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972018-11-0145673374010.3785/j.issn.1008-9497.2018.06.015A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法)YUQi(喻奇)0https://orcid.org/0000-0001-7099-1581WANGLunyao(王伦耀)1https://orcid.org/0000-0002-6156-7495XIAYinshui(夏银水)2School of Information Science and Engineering, Ningbo University, Ningbo 315211, Zhejiang Province, China(宁波大学信息科学与工程学院，浙江 宁波 315211)School of Information Science and Engineering, Ningbo University, Ningbo 315211, Zhejiang Province, China(宁波大学信息科学与工程学院，浙江 宁波 315211)School of Information Science and Engineering, Ningbo University, Ningbo 315211, Zhejiang Province, China(宁波大学信息科学与工程学院，浙江 宁波 315211)针对library-free映射过程中常用的动态规划算法在求解大电路时覆盖时间过长的问题，提出了一种将动态规划与遗传算法相结合的混合优化算法，用于平衡求解速度和求解质量，并利用“与/或/非”图和逻辑努力实现基于MOS晶体管的电路的面积估算.MCNC电路的测试结果显示，相较于动态规划，混合算法求得的最优解在面积平均增加不到1%的情况下，求解时间可节省35%以上.https://doi.org/10.3785/j.issn.1008-9497.2018.06.015逻辑优化library-free映射算法逻辑努力 |
| spellingShingle | YUQi(喻奇) WANGLunyao(王伦耀) XIAYinshui(夏银水) A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法) Zhejiang Daxue xuebao. Lixue ban 逻辑优化 library-free 映射算法 逻辑努力 |
| title | A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法) |
| title_full | A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法) |
| title_fullStr | A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法) |
| title_full_unstemmed | A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法) |
| title_short | A fast area optimization method using library-free mapping(基于library-free映射的电路面积快速优化算法) |
| title_sort | fast area optimization method using library free mapping 基于library free映射的电路面积快速优化算法 |
| topic | 逻辑优化 library-free 映射算法 逻辑努力 |
| url | https://doi.org/10.3785/j.issn.1008-9497.2018.06.015 |
| work_keys_str_mv | AT yuqiyùqí afastareaoptimizationmethodusinglibraryfreemappingjīyúlibraryfreeyìngshèdediànlùmiànjīkuàisùyōuhuàsuànfǎ AT wanglunyaowánglúnyào afastareaoptimizationmethodusinglibraryfreemappingjīyúlibraryfreeyìngshèdediànlùmiànjīkuàisùyōuhuàsuànfǎ AT xiayinshuixiàyínshuǐ afastareaoptimizationmethodusinglibraryfreemappingjīyúlibraryfreeyìngshèdediànlùmiànjīkuàisùyōuhuàsuànfǎ AT yuqiyùqí fastareaoptimizationmethodusinglibraryfreemappingjīyúlibraryfreeyìngshèdediànlùmiànjīkuàisùyōuhuàsuànfǎ AT wanglunyaowánglúnyào fastareaoptimizationmethodusinglibraryfreemappingjīyúlibraryfreeyìngshèdediànlùmiànjīkuàisùyōuhuàsuànfǎ AT xiayinshuixiàyínshuǐ fastareaoptimizationmethodusinglibraryfreemappingjīyúlibraryfreeyìngshèdediànlùmiànjīkuàisùyōuhuàsuànfǎ |