公开(公告)号：US07886245B2

公开(公告)日：2011-02-08

申请号：US12032734

申请日：2008-02-18

Applicant: Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

Inventor： Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

IPC: G06F17/50

CPC classification number: G06F17/5068 ,  G06F2217/62 ,  G06F2217/84

Abstract: A design structure for designing an electronic circuit, especially a clock tree and a sub-clock tree, within a set of sinks with given target arrival time windows, preferably on an integrated circuit designed by an IC design house or other circuit design provider. The clock tree and the sub-clock tree are preferably connected through one or multiple fixed circuits which must not be altered, cloned or removed. Several alternative implementations of the at least one logic structure are built and for each of the several alternative implementations data is stored. A set of configurations is built, each configuration comprising a combination of the one or several alternative implementations and each configuration satisfying the target arrival time windows at the complete set of sinks. A configuration is selected according to an evaluation of the data, preferably latency data, for constructing the configuration. No manual interaction is needed and a configuration with minimum latencies is provided.

Abstract translation: 一种设计结构，用于设计具有给定目标到达时间窗口的一组接收器内的电子电路，特别是时钟树和子时钟树，优选地在由IC设计公司或其他电路设计提供商设计的集成电路上。 时钟树和子时钟树优选通过一个或多个固定电路来连接，这些电路不能被改变，克隆或去除。 构建至少一个逻辑结构的几个替代实施方案，并且为了存储数据的几个备选实现中的每一个。 构建一组配置，每个配置包括一个或多个替代实现的组合，并且每个配置满足完整集合集合处的目标到达时间窗口。 根据用于构造配置的数据（优选等待时间数据）的评估来选择配置。 不需要手动交互，并提供具有最小延迟的配置。

公开(公告)号：US20080216042A1

公开(公告)日：2008-09-04

申请号：US12032728

申请日：2008-02-18

Applicant: Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

Inventor： Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

IPC: G06F17/50

CPC classification number: G06F17/5068 ,  G06F2217/62 ,  G06F2217/84

Abstract: A method and program for designing an electronic circuit, especially a clock tree and a sub-clock tree, within a set of sinks with given target arrival time windows, preferably on an integrated circuit. The clock tree and the sub-clock tree are preferably connected through one or multiple fixed circuits which must not be altered, cloned or removed. Several alternative implementations of the at least one logic structure are built and for each of the several alternative implementations data is stored. A set of configurations is built, each configuration comprising a combination of the one or several alternative implementations and each configuration satisfying the target arrival time windows at the complete set of sinks. A configuration is selected according to an evaluation of the data, preferably latency data, for constructing the configuration. No manual interaction is needed and a configuration with minimum latencies is provided.

Abstract translation: 一种用于设计具有给定的目标到达时间窗口的一组信宿中的电子电路，特别是时钟树和子时钟树的方法和程序，优选地在集成电路上。 时钟树和子时钟树优选通过一个或多个固定电路来连接，这些电路不能被改变，克隆或去除。 构建至少一个逻辑结构的几个替代实施方案，并且为了存储数据的几个备选实现中的每一个。 构建一组配置，每个配置包括一个或多个替代实现的组合，并且每个配置满足完整集合集合处的目标到达时间窗口。 根据用于构造配置的数据（优选等待时间数据）的评估来选择配置。 不需要手动交互，并提供具有最小延迟的配置。

公开(公告)号：US20190020578A1

公开(公告)日：2019-01-17

申请号：US15648630

申请日：2017-07-13

Applicant: Clemens Beckmann ,  Karin Pientka ,  Lutz Fischer ,  Lars Krämer ,  Jens Vygen ,  Stephan Held ,  Dirk Müller

Inventor： Clemens Beckmann ,  Karin Pientka ,  Lutz Fischer ,  Lars Krämer ,  Jens Vygen ,  Stephan Held ,  Dirk Müller

IPC: H04L12/717 ,  H04L12/721 ,  H04L12/707 ,  H04L12/751

Abstract: A method for routing is disclosed. The method involves obtaining information on a plurality of to-be-transported entities (TBTEs) that are each associated with a respective pick-up position and a respective drop-off position; determining a set of one or more transport routes (TRs), each of the TRs associated with a respective transport entity (TE) and defining a respective sequence of waypoints, wherein the set of TRs is determined to at least fulfil a criterion that, for each of the TBTEs, the pick-up position and drop-off position are associated with respective waypoints of the same respective TR or the pick-up position is associated with a respective waypoint of one TR and the drop-off position is associated with a respective waypoint of another TR that is connected with the one TR; and providing respective representations of at least a part of the TRs to the respective TEs associated with the TRs.

公开(公告)号：US07844931B2

公开(公告)日：2010-11-30

申请号：US12032728

申请日：2008-02-18

Applicant: Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

Inventor： Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

IPC: G06F17/50

CPC classification number: G06F17/5068 ,  G06F2217/62 ,  G06F2217/84

Abstract: A method and program for designing an electronic circuit, especially a clock tree and a sub-clock tree, within a set of sinks with given target arrival time windows, preferably on an integrated circuit. The clock tree and the sub-clock tree are preferably connected through one or multiple fixed circuits which must not be altered, cloned or removed. Several alternative implementations of the at least one logic structure are built and for each of the several alternative implementations data is stored. A set of configurations is built, each configuration comprising a combination of the one or several alternative implementations and each configuration satisfying the target arrival time windows at the complete set of sinks. A configuration is selected according to an evaluation of the data, preferably latency data, for constructing the configuration. No manual interaction is needed and a configuration with minimum latencies is provided.

Abstract translation: 一种用于设计具有给定的目标到达时间窗口的一组信宿中的电子电路，特别是时钟树和子时钟树的方法和程序，优选地在集成电路上。 时钟树和子时钟树优选通过一个或多个固定电路来连接，这些电路不能被改变，克隆或去除。 构建至少一个逻辑结构的几个替代实施方案，并且为了存储数据的几个备选实现中的每一个。 构建一组配置，每个配置包括一个或多个替代实现的组合，并且每个配置满足完整集合集合处的目标到达时间窗口。 根据用于构造配置的数据（优选等待时间数据）的评估来选择配置。 不需要手动交互，并提供具有最小延迟的配置。

公开(公告)号：US20080216043A1

公开(公告)日：2008-09-04

申请号：US12032734

申请日：2008-02-18

Applicant: Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

Inventor： Guenther Hutzl ,  Stephan Held ,  Juergen Koehl ,  Bernhard Korte ,  Jens Massberg ,  Matthias Ringe ,  Jens Vygen

IPC: G06F17/50

CPC classification number: G06F17/5068 ,  G06F2217/62 ,  G06F2217/84

Abstract: A design structure for designing an electronic circuit, especially a clock tree and a sub-clock tree, within a set of sinks with given target arrival time windows, preferably on an integrated circuit designed by an IC design house or other circuit design provider. The clock tree and the sub-clock tree are preferably connected through one or multiple fixed circuits which must not be altered, cloned or removed. Several alternative implementations of the at least one logic structure are built and for each of the several alternative implementations data is stored. A set of configurations is built, each configuration comprising a combination of the one or several alternative implementations and each configuration satisfying the target arrival time windows at the complete set of sinks. A configuration is selected according to an evaluation of the data, preferably latency data, for constructing the configuration. No manual interaction is needed and a configuration with minimum latencies is provided.

Abstract translation: 一种设计结构，用于设计具有给定目标到达时间窗口的一组接收器内的电子电路，特别是时钟树和子时钟树，优选地在由IC设计公司或其他电路设计提供商设计的集成电路上。 时钟树和子时钟树优选通过一个或多个固定电路来连接，这些电路不能被改变，克隆或去除。 构建至少一个逻辑结构的几个替代实施方案，并且为了存储数据的几个备选实现中的每一个。 构建一组配置，每个配置包括一个或多个替代实现的组合，并且每个配置满足完整集合集合处的目标到达时间窗口。 根据用于构造配置的数据（优选等待时间数据）的评估来选择配置。 不需要手动交互，并提供具有最小延迟的配置。