A routing algorithm for irregular channel based on md model
Dinghua Lou, Yi Li, Xuliang Zhang, Juebang Yu
Abstract
Dinghua Lou, Yi Li, Xuliang Zhang, Juebang Yu
Abstract
It is well known that non-Manhattan channel routing always gives a better result than that yielded from a Manhattan router in a given channel. The paper proposes a new greedy non-Manhattan channel routing algorithm based on a Manhattan-diagonal (MD) model. The router uses h track for any channel without cyclic vertical constraints, and d<h
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is well known that non-Manhattan channel routing always gives a better result than that yielded from a Manhattan router in a given channel. The paper proposes a new greedy non-Manhattan channel routing algorithm based on a Manhattan-diagonal (MD) model. The router uses h track for any channel without cyclic vertical constraints, and d<h
Key concepts: Channel (broadcasting), Routing (electronic design automation), Router, Computer science, Algorithm, Diagonal, Routing algorithm, Routing table