Patents by Inventor Johannes Koesters

Johannes Koesters 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).

  • Publication number: 20070136703
    Abstract: An apparatus for performing temporal checking is disclosed. A signal logger for performing temporal checking includes a group of edge detection modules and a group of counting modules. During testing, the signal logger is coupled to a device under testing (DUT). Each of the edge detection modules is capable of maintaining edge information after a state transition on a signal within the DUT has been detected. Each of the counting modules is associated with one of the edge detection modules. Each of the countering modules is capable of maintaining a clock cycle count information associated with a detected edge. After the testing has been completed, temporal checking information on a signal within the DUT can be obtained by reconstructing the edge information and the associated clock cycle count information of the signal collected during the test.
    Type: Application
    Filed: December 8, 2005
    Publication date: June 14, 2007
    Applicant: International Business Machines Corporation
    Inventors: Parag Birmiwal, Sundeep Chadha, Tilman Gloekler, Johannes Koesters
  • Patent number: 7213220
    Abstract: The present invention relates to the field of computer hardware locic circuits, and in particular to a method for verifying the proper operation of a digital logic circuit, and in particular to symbolic simulation of a gate-level netlist corresponding to said hardware logic circuit. In order to add a useful alternative in the field of functional, exhaustive simulation and of symbolic simulation, it is proposed to perform the steps of: a) analyzing symbolic expressions visible at predetermined locations within said logic; b) determining, which nets in the netlist carry complex symbolic expressions, which comprise more than one symbol; c) replacing said complex expressions with a “crunshed color”, for cutting off said complex symbolic expression from further propagation through the netlist; d) continuing said symbolic simulation including said crunched color information on predetermined nets.
    Type: Grant
    Filed: December 10, 2004
    Date of Patent: May 1, 2007
    Assignee: International Business Machines Corporation
    Inventors: Bodo Hoppe, Christoph Jaeschke, Johannes Koesters
  • Publication number: 20070089004
    Abstract: The present invention provides a method, an apparatus, and a computer program product for applying external clock and data patterns for TTP-LBIST. A simulation model for the logic under test is set up in a simulator. Next, a user sets up an external LBIST block, which comprises pre-verified internal clock and data pattern logic, and connects this block to the logic in the simulation model. The internal clock and data pattern logic provides the input patterns used in OCPG modes of LBIST. This internal clock and data pattern logic is already verified through the design effort. Therefore, the internal pattern generators become the external pattern generators in the simulation model. The external LBIST block applies the external clock and data patterns, and subsequently, the user receives and processes these output patterns to determine if the logic operates correctly.
    Type: Application
    Filed: October 18, 2005
    Publication date: April 19, 2007
    Inventors: Tilman Gloekler, Christian Habermann, Naoki Kiryu, Joachim Kneisel, Johannes Koesters
  • Publication number: 20070061644
    Abstract: Methods, apparatus, and products are disclosed for scan verification for a simulated device under test (‘DUT’), the DUT having scan chains, scan inputs, and scan outputs that include verifying correct data entry from the scan inputs of the DUT into the beginning of the scan chain, verifying correct propagation of scan data in the scan chain between the scan inputs and the scan outputs, verifying correct data output from the end of the scan chain to the scan outputs, and leak testing the scan chain with undetermined states for scan cells in the scan chain.
    Type: Application
    Filed: August 18, 2005
    Publication date: March 15, 2007
    Applicant: International Business Machines Corporation
    Inventors: Parag Birmiwal, Tilman Gloekler, Klaus Heinzelmann, Johannes Koesters
  • Publication number: 20070050739
    Abstract: The present invention relates to a method for verifying the proper operation of a digital logic circuit. In order to add a useful alternative in the field of functional, exhaustive simulation and of symbolic simulation, it is proposed to perform the steps of: a) marking a net with an additional property other than the bit value, both, bit value and additional property being valid at said net at a given time, b) propagating the marking of the net according to a set of predetermined semantic rules, wherein the rules are defined according to a predetermined simulation aim, c) generating an output at a predetermined downstream location of the circuit, said output providing an information, if or if not said property has propagated through the circuit to said predetermined circuit location.
    Type: Application
    Filed: August 1, 2006
    Publication date: March 1, 2007
    Inventors: Bodo Hoppe, Christoph Jaeschke, Johannes Koesters
  • Publication number: 20070033468
    Abstract: A system, apparatus and method of isolating a plurality of limiting logical cones in a chip during a logical built-in self test (LBIST) are provided. An LBIST is performed on the chip in order to locate a first latch that fails the test. Particularly, latches on the chip are arranged in a plurality of scan chains wherein each latch holds data for a logical cone. The LBIST is performed on one scan chain at a time. Once the first latch is located, a first limiting cone (i.e., the cone for which the first latch is holding data) may be isolated. After isolating the first limiting cone, the data from the first latch is masked out and the LBIST is repeated on the scan chain. The data is masked out in order to facilitate the identification of any other latch that may fail the test. Again, if another latch fails the test a corresponding limiting cone may be isolated.
    Type: Application
    Filed: July 14, 2005
    Publication date: February 8, 2007
    Inventors: Rolf Hilgendorf, Johannes Koesters, Thomas Pflueger
  • Publication number: 20060190874
    Abstract: A method, system and computer program product for performing verification is disclosed. A high-level description of a design is created and constrained drivers are synthesized from the high-level description of the design. A testbench is generated from the high-level description of the design and the constrained drivers and a formal equivalence is evaluated on the testbench to perform verification.
    Type: Application
    Filed: February 24, 2005
    Publication date: August 24, 2006
    Applicant: International Business Machines Corporation
    Inventors: Jason Baumgartner, Tilman Gloekler, Joachim Kneisel, Johannes Koesters
  • Publication number: 20050138586
    Abstract: The present invention relates to the field of computer hardware locic circuits, and in particular to a method for verifying the proper operation of a digital logic circuit, and in particular to symbolic simulation of a gate-level netlist corresponding to said hardware logic circuit. In order to add a useful alternative in the field of functional, exhaustive simulation and of symbolic simulation, it is proposed to perform the steps of: a) analyzing symbolic expressions visible at predetermined locations within said logic, b) determining, which nets in the netlist carry complex symbolic expressions, which comprise more than one symbol, c) replacing said complex expressions with a “crunshed color”, for cutting off said complex symbolic expression from further propagation through the netlist, d) continuing said symbolic simulation including said crunched color information on predetermined nets.
    Type: Application
    Filed: December 10, 2004
    Publication date: June 23, 2005
    Applicant: International Business Machines Corporation
    Inventors: Bodo Hoppe, Christoph Jaeschke, Johannes Koesters
  • Publication number: 20050033898
    Abstract: The present invention provides a method and apparatus for efficiently loading values into scan and non-scan memory elements. First, the network used to distribute control signals to the memory elements is cleared. Second, the desired values are loaded into the scan memory elements. Third, the values from the scan memory elements are propagated to the non-scan memory elements.
    Type: Application
    Filed: August 7, 2003
    Publication date: February 10, 2005
    Applicant: International Business Machines Corporation
    Inventors: Richard Anderson, Johannes Koesters, Steven Roberts
  • Publication number: 20020173943
    Abstract: The present invention generally relates to hardware development and design, and in particular it relates to a method for simulating hardware. A meta model (22) is compiled for integrating a plurality of n different instantiations (12A, . . . 12N) of the same hardware model, and facilities and signals of different instantiations are resolved by instantiation-specific name space specifications in a code switch (24,26). Thus, computing time is saved because by simulating the meta model, the processor resources, for instance, storage spaces, are utilized more efficiently.
    Type: Application
    Filed: May 15, 2002
    Publication date: November 21, 2002
    Applicant: International Business Machines Corporation
    Inventors: Frank Armbruster, Bodo Eberhard Hoppe, Johannes Koesters, Klaus-Dieter Schubert