通道布線演算法 的英文怎麼說

中文拼音 [tōngdàobùxiànyǎnsuànfǎ]
通道布線演算法 英文
channel routing algorithm
  • 通 : 通量詞（用於動作）
  • 道 : Ⅰ名詞（道路） road; way; route; path 2 （水流通過的途徑） channel; course 3 （方向; 方法; 道理） ...
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 通道 : thoroughfare; passageway; pass; enterclose; gallery; drong; tunnel; avenue; alure; way; row; key ...
  1. The comparison results show that the left edge algorithm can only resolve the channel routing problem without vertical constraints, while the greedy channel router can accomplish the problem with vertical and horizontal constraints

    比較結果證明，左邊演算法只能解決不存在垂直約束的通道布線問題，而貪婪演算法在充分考慮垂直和水平約束的條件下能較好地完成布線。
  2. As a preliminary investigation of the channel automatic routing, some of the channel router algorithm, such as left edge algorithm, the dogleg algorithm, net merge channel router and greedy channel router, are analyzed

    作為通道自動布線的初步探索，論文分析了幾種常見的通道布線演算法如左邊演算法、狗腿演算法、合併演算法、貪婪演算法。
  3. In deep sub - micron technology, the scale of integration and the degree of complexity of circuit increase rapidly, it is necessary and feasible to adopt non - manhattan model for detailed routing in vlsi physical design. aiming at the current pop point a novel non - manhattan otc router is proposed in section 4. according to the routing algorithm of channel area the new otc router selects nets on cell by using net segment valid controlling column technology, deep searching to column density technology and utilization of vacant terminals technology

    結合通道區域所用非曼哈頓布線演算法的特點，通過採用線網段有效控制列技術、列密度深度探測技術及空端利用技術對單元區可布線網進行有效選擇，成功地實現了該非曼哈頓單元上布線演算法，並將其應用於一些經典的benchmark中，和目前文獻中現有演算法相比取得了更優的布線結果。
  4. As a supplement to traditional detailed routing model it researches on detailed routing problem from a new point of view. using this detailed routing model can easily handle the cycle constraints in channel routing and interconnections of circuit modules which don ’ t border upon by transferring nets from layer to layer. by similar methods, channel area can be transformed into an ideal algorithm model to meet used channel routing algorithm and some error of global routing can also be amended

    和傳統通道布線模型相比，該模型復合採用通道布線層和區域布線層，通過層間線網轉移的方法，可以克服傳統通道布線演算法中處理循環約束問題和處理不相鄰模塊間互連問題的困難，還可以把通道區域處理為滿足各種通道布線演算法的理想模型，並且可以靈活處理一些總體布線中的不理想之處。
  5. With the computer programs, the left edge algorithm and the greedy channel router are performed. a channel example in the lcd driving circuit is used to compare these two and the results routed by hand

    通過程序實現了左邊演算法和貪婪演算法，並以該液晶顯示驅動電路asic的一個通道實例比較了左邊演算法布線、貪婪演算法布線以及人工布線的區別。
  6. However in aspect of reducing channel height, via number and average route length, the results from the greedy channel router is not as good as the results routed by hand. more studies are required for better algorithm

    但對貪婪演算法來說，在減少通道高度、通孔數和平均布線長度方面都還比不上人工布線，更優良的通道布線演算法有待于進一步的研究探索。
分享友人
分享到 Line

分享到臉書