Patents by Inventor Markus Olbrich

Markus Olbrich has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8731858
    Abstract: Calculating a timing delay in a repeater network in an electronic circuit. The repeater network comprises a plurality of driving cells. At least one loop comprising one or more pins and one or more driving cells for driving the loop is implemented. Each driving cell in the loop is arranged between two branches of the loop. For each driving cell, the loop is opened a plurality of times per driving cell, with one open at a time. A dedicated arrival time of a signal at each sink of the repeater network for the one open at a time per driving cell is calculated. The dedicated arrival time is stored. The calculation step and the storing step is repeated until the dedicated arrival time at each sink of the repeater network is available for each of the opens per driving cell.
    Type: Grant
    Filed: October 13, 2009
    Date of Patent: May 20, 2014
    Assignee: International Business Machines Corporation
    Inventors: Markus Buehler, Juergen Kuehl, Markus Olbrich, Philipp Panitz
  • Patent number: 8627263
    Abstract: A method comprises determining gate configuration from a standard cell library for optimizing behavior of a logic gate in an electronic circuit to be resized. The determining includes defining variables for the logic gate to be resized and defining nets influenced by the logic gate to be resized. The determining includes determining constraints relative to other logic gates in the electronic circuit affected by the logic gate to be resized and formulating objective function. The determining includes solving the objective function using a linear programming solver based on the defined variables and the determined constraints. The determining includes outputting solving of the objective function obtained by linear programming solver for further processing. The gate configuration is selected from the standard cell library for optimizing behavior of the logic gate to be resized based on solving of the objective function.
    Type: Grant
    Filed: February 3, 2012
    Date of Patent: January 7, 2014
    Assignee: International Business Machines Corporation
    Inventors: Thomas Buechner, Markus Buehler, Markus Olbrich, Philipp Panitz, Lei Wang
  • Patent number: 8612911
    Abstract: A method comprises estimating power consumption of an electronic circuit. The estimating includes assigning a first gate of the at least one gate into a priority queue based on a levelized result of the electronic circuit for a full circuit calculation and assigning a second gate of the at least one gate into the priority queue which fan-out gate is directly connected to a fan-in gate of a resized gate for an incremental circuit calculation. The estimating includes, for each gate from the priority queue, performing the following operations. Latest and earliest signal arrival times at an output net of the gate are determined by static timing analysis and calculating a glitch window as difference, and a transition metric is calculated for the output net based on the glitch window. The operations include determining an upper bound of signal transitions, and estimating the power consumption based on the upper bound.
    Type: Grant
    Filed: February 3, 2012
    Date of Patent: December 17, 2013
    Assignee: International Business Machines Corporation
    Inventors: Thomas Buechner, Markus Buehler, Philipp Panitz, Lei Wang, Markus Olbrich
  • Patent number: 8407654
    Abstract: A method comprises reducing power consumption of an electronic circuit, wherein the electronic circuit comprises at least one logic cone with at least one gate having a single output net, wherein representations of the at least one gate are instances of elements from a standard cell library. Reducing of the power consumption comprises determining an upper bound for dynamic power consumption by calculating transition metrics and power metrics for each gate. Reducing of the power consumption comprises selecting gates with an upper bound for power consumption greater than a predetermined threshold value.
    Type: Grant
    Filed: February 3, 2012
    Date of Patent: March 26, 2013
    Assignee: International Business Machines Corporation
    Inventors: Thomas Buechner, Markus Buehler, Markus Olbrich, Philipp Panitz, Lei Wang
  • Publication number: 20120266120
    Abstract: A method comprises reducing power consumption of an electronic circuit, wherein the electronic circuit comprises at least one logic cone with at least one gate having a single output net, wherein representations of the at least one gate are instances of elements from a standard cell library. Reducing of the power consumption comprises determining an upper bound for dynamic power consumption by calculating transition metrics and power metrics for each gate. Reducing of the power consumption comprises selecting gates with an upper bound for power consumption greater than a predetermined threshold value.
    Type: Application
    Filed: February 3, 2012
    Publication date: October 18, 2012
    Applicant: International Business Machines Corporation
    Inventors: Thomas Buechner, Markus Buehler, Markus Olbrich, Philipp Panitz, Lei Wang
  • Publication number: 20120216168
    Abstract: A method comprises determining gate configuration from a standard cell library for optimizing behavior of a logic gate in an electronic circuit to be resized. The determining includes defining variables for the logic gate to be resized and defining nets influenced by the logic gate to be resized. The determining includes determining constraints relative to other logic gates in the electronic circuit affected by the logic gate to be resized and formulating objective function to be solved by the electronic circuit. The determining includes solving the objective function using a linear programming solver based on the defined variables and the determined constraints. The determining includes outputting solving of the objective function obtained by linear programming solver for further processing. The gate configuration is selected from the standard cell library for optimizing behavior of the logic gate to be resized based on solving of the objective function.
    Type: Application
    Filed: February 3, 2012
    Publication date: August 23, 2012
    Applicant: International Business Machines Corporation
    Inventors: Thomas Buechner, Markus Buehler, Markus Olbrich, Philipp Panitz, Lei Wang
  • Publication number: 20120216160
    Abstract: A method comprises estimating power consumption of an electronic circuit. The estimating includes assigning a first gate of the at least one gate into a priority queue based on a levelized result of the electronic circuit for a full circuit calculation and assigning a second gate of the at least one gate into the priority queue which fan-out gate is directly connected to a fan-in gate of a resized gate for an incremental circuit calculation. The estimating includes, for each gate from the priority queue, performing the following operations. Latest and earliest signal arrival times at an output net of the gate are determined by static timing analysis and calculating a glitch window as difference, and a transition metric is calculated for the output net based on the glitch window. The operations include determining an upper bound of signal transitions, and estimating the power consumption based on the upper bound.
    Type: Application
    Filed: February 3, 2012
    Publication date: August 23, 2012
    Applicant: International Business Machines Corporation
    Inventors: Thomas Buechner, Markus Buehler, Philipp Panitz, Lei Wang, Markus Olbrich
  • Patent number: 8015527
    Abstract: The invention relates to a delay calculation method for wiring nets of an electronic circuit, wherein a net within an electronic circuit comprises a driver pin and a receiving pin being coupled by at least one loop, the loop comprising a first branching path and a second branching path electrically parallel to the first branching path, wherein at least a first and a second branching point connect the branching paths. The method comprises the steps of disconnecting each branching path once at a time at a specific point in said the at least one loop which connects a driver to at least one specific receiving pin; calculating a delay value of a signal connection between the driver pin and each of the receiving pin for each of the disconnected branching paths of each loop; storing maximum and/or minimum calculated delay values; and applying at least one of the delay values for static timing analysis of the electronic circuit.
    Type: Grant
    Filed: July 1, 2008
    Date of Patent: September 6, 2011
    Assignee: International Business Machines Corporation
    Inventors: Markus Buehler, Juergen Koehl, Markus Olbrich, Philipp Panitz
  • Publication number: 20100100347
    Abstract: Calculating a timing delay in a repeater network in an electronic circuit. The repeater network comprises a plurality of driving cells. At least one loop comprising one or more pins and one or more driving cells for driving the loop is implemented. Each driving cell in the loop is arranged between two branches of the loop. For each driving cell, the loop is opened a plurality of times per driving cell, with one open at a time. A dedicated arrival time of a signal at each sink of the repeater network for the one open at a time per driving cell is calculated. The dedicated arrival time is stored. The calculation step and the storing step is repeated until the dedicated arrival time at each sink of the repeater network is available for each of the opens per driving cell.
    Type: Application
    Filed: October 13, 2009
    Publication date: April 22, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Markus Buehler, Juergen Kuehl, Markus Olbrich, Philipp Panitz
  • Publication number: 20090013293
    Abstract: The invention relates to a delay calculation method for wiring nets of an electronic circuit, wherein a net within an electronic circuit comprises a driver pin (P0; P30) and a receiving pin (P1-P19; P32-P42) being coupled by at least one loop (40, 50; 60, 70, 80), said loop (40, 50; 60, 70, 80) comprising a first branching path (BP40a, BP50a) and a second branching path (BP40b, BP50b) electrically parallel to said first branching path (BP40a, BP50a), wherein at least a first and a second branching point (I, OP10; P30, OP1, P42) connect said branching paths (BP40a, BP40b; BP50a, BP50b).
    Type: Application
    Filed: July 1, 2008
    Publication date: January 8, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Markus Buehler, Juergen Koehl, Markus Olbrich, Philipp Punitz
  • Publication number: 20080059933
    Abstract: The present invention relates to a method for designing fan-out nets connecting a signal source and a plurality of net elements in an integrated circuit. In order to make fan-out nets more robust against opens while keeping the risk due to short circuits in an acceptable degree, the method comprises the steps of: a) implementing a routing section in a closed structure comprising a plurality of signal receiving pins, wherein said receiving pins connect to further net elements, b) implementing on said closed structure a plurality of buffer elements to provide multiple signals derived from said source signal for driving said plurality of net elements, and c) limiting the distance and number of receiving cells between two buffer elements below predetermined values in order to keep a short circuit current given in case of an open tolerably small and within a worst case skew time delay.
    Type: Application
    Filed: August 28, 2007
    Publication date: March 6, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Erich Barke, Markus Buehler, Juergen Koehl, Markus Olbrich, Philipp Panitz