一种新的L－型通道区布线算法

A NEW L-SHAPED CHANNEL ROUTER

本算法把Ｌ－通道区分成两个三边通道，从分析割值出发，确定Ｌ－型通过的初始宽度。为达到总体布线最优，采用迭代法和改进的“贪婪，算法，交替实现水平和垂直通道的布线。

The L-shaped channel is divided into three three-side subchannels using the new routing algorithm Based on the cutline analysis, initial width of the channel is determined.In order to make the global routing optimal, vertical and horizontal subchannels are implemented alternately by using an iteration method and an improved 'greedy' algorithm.