Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In clock network synthesis, sometimes skew constraints are required only within certain groups of clock sinks and do not exist beten different groups. This is the so-called associative skew clock routing problem. Although the number of constraints is reduced, the problem becomes more difficult to solve due to the enlarged solution space. The perhaps only previous work used a very primitive delay model and cannot handle difficult instances in which sink groups are intermingled.  reuse existing techniques to solve this problem, including the difficult instances, based on a more accurate and popular delay model. Experimental results show that our algorithm can reduce the total clock routing wirelength by 12% on average compared to greedy-DME which is one of the best zero skew routing algorithms.
['Min-Seok Kim', 'Jiang Hu']
I am writing a research paper on a idea Associative Skew Clock Routing for Difficult Instances
[{"from": "human", "value": "I am writing a research paper on a idea Associative Skew Clock Routing for Difficult Instances"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In clock network synthesis, sometimes skew constraints are required only within certain groups of clock sinks and do not exist beten different groups. This is the so-called associative skew clock routing problem. Although the number of constraints is reduced, the problem becomes more difficult to solve due to the enlarged solution space. The perhaps only previous work used a very primitive delay model and cannot handle difficult instances in which sink groups are intermingled.  reuse existing techniques to solve this problem, including the difficult instances, based on a more accurate and popular delay model. Experimental results show that our algorithm can reduce the total clock routing wirelength by 12% on average compared to greedy-DME which is one of the best zero skew routing algorithms."}]