English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 61345/61345 (100%)
造訪人次 : 16286386      線上人數 : 225
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/63548


    題名: 使用平行化基因演算法產生共質心電容布 局之研究;The Study on Generating Common-Centroid Capacitors Placement with Parallel Genetic Algorithm
    作者: 陳志華;Chen,Chih-Hwa
    貢獻者: 電機工程學系在職專班
    關鍵詞: 平行化;基因演算法;共質心;電容佈局;Parallel;Genetic Algorithm;Common-Centroid;Capacitors Placement
    日期: 2014-01-27
    上傳時間: 2014-04-02 15:48:29 (UTC+8)
    出版者: 國立中央大學
    摘要: 在現今常見的類比積體電路中,如類比/數位轉換器及切換式電容電路,效能的關鍵樞鈕,常常在於其電路中電容陣列的電容比例精確度,而如何實現其精確的電容比例在目前仍是一項很重要的議題。在類比積體電路製造過程中,常常會發生主要兩類的不匹配現象:系統性不匹配和隨機性不匹配。系統性不匹配形成的主要原因,常見為不對稱的元件擺放方式,造成氧化層厚度的變動,間而影響到了製程梯度,產生了梯度誤差。而隨機性不匹配常常是因類比電路在製造過程中,自然界中相關的隨機變動,影響到了多項製程參數而造成了隨機性不匹配,而不匹配的現象也影響到了電路效能及穩定性。
    目前已有許多相關的研究在試圖找出如何同時解決兩者不匹配的狀況,並獲得最佳的電容布局,但泰半方法都得犧牲許多運算時間來換得更好的結果。本篇論文旨在發展一平行基因演算法,使其符合求取最佳電容布局結果的相關條件再加上相對應的改良式基因操作,最後再輔以現代社會廣泛普遍的多核心系統,讓程式架構、平行處理及多核心系統等效能因子能融為一個整體,讓整個運算效能能以倍數來成長。而經過實驗後,結果也顯示了相對於啟發式演算法、模擬退火法,甚或是數學分析法,我們所發展的平行基因演算法可以在更短的時間內產生出品質參數接近或更好的電容布局,在電容布局研究的耗時問題解決上又大大的邁出了一步。; In the common analog integrated circuits today, such as an analog-to-digital converter and switched-capacitor circuit, the critical point of its performance often depends on the high accuracy capacitance ratios. And how to implement the accurate capacitance ratios is still an important issue so far. During the manufacturing process for analog integrated circuits, there are two major types of capacitor mismatches: system mismatch and random mismatch. Usually, the main cause of system mismatch is the unsymmetrical device placement and results in the variation of oxide thickness which affects the process gradient and causes the gradient errors. And Random mismatch often appears with the relatedly random variation in nature which affects most of process parameters during the analog integrated circuits manufacturing process. The mismatch not only reduces the circuit performance but also make the circuit unstable.
    There are many related researches to find out how to solve these two kinds of mismatch issues and try to acquire the best capacitors placement up to now, but most of them need much runtime to get the better results. Because of the reasons mentioned above, this thesis aims to develop the parallel genetic algorithm to obtain the best capacitors placement by satisfying the design requirements and going with the corresponding genetic operations. At last, we work the algorithm on the multi-core system to double the operational speed. The experimental results show that our method can generate the better capacitors placement with shorter runtime and make great progress in solving the time-consuming problem of capacitor placement.
    顯示於類別:[電機工程學系碩士在職專班] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML664檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright © National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋  - 隱私權政策聲明