Patents by Inventor Tobias Gemmeke
Tobias Gemmeke 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: 7735038Abstract: A design structure to reduce power consumption within a clock gated synchronous circuit, said synchronous circuit comprising at least two successive stages, wherein each stage if activated propagates a data signal cycle by cycle to a succeeding stage the two successive stages comprising at least a control register, a data register and a local clock buffer (LCB) each, wherein each stage if activated propagates a data signal stored within the data register cycle by cycle to a data register of a succeeding stage.Type: GrantFiled: September 6, 2007Date of Patent: June 8, 2010Assignee: International Business Machines CorporationInventors: Tobias Gemmeke, Jens Leenstra, Jochen Preiss
-
Publication number: 20100057825Abstract: A method for operand width reduction is described, wherein two N-bit input operands (A, B) of a bit width of N are processed and two M-bit output operands (A?, B?) of a reduced bit width of M are generated in a way, that a post-processing comprising an M-bit adder function followed by saturation to M bits performed on said two M-bit output operands (A?, B?) provides an M-bit result equal to an M-bit result of an N-bit modulo adder function of the two N-bit input operands (A, B), followed by a saturation to M bits. Further an electronic computing circuit (1, 5) is described performing said method. Additionally a computer system comprising such an electronic computing circuit is described.Type: ApplicationFiled: February 11, 2008Publication date: March 4, 2010Applicant: International Business Machines CorporationInventors: Tobias Gemmeke, Nicolas Maeding, Jochen Preiss
-
Patent number: 7639046Abstract: A method to reduce power consumption within a clock gated synchronous circuit, said synchronous circuit comprising at least two successive stages, wherein each stage if activated propagates a data signal cycle by cycle to a succeeding stage, comprising the steps of: deriving a local clock activation signal from an external clock activation signal, wherein said local clock activation signal changes its value every cycle the external clock activation signal indicates a propagation, propagating the data signal and the local clock activation signal synchronously cycle by cycle from a particular stage to a succeeding stage whenever a local clock activation signal at the particular stage by derivation from the clock activation signal or by propagation through the synchronous circuit changes its value between two successive cycles, in order to propagate the data signal and the local clock activating signal within the same clock domain through the clock gated synchronous circuit.Type: GrantFiled: September 6, 2007Date of Patent: December 29, 2009Assignee: International Business Machines CorporationInventors: Tobias Gemmeke, Jens Leenstra, Jochen Preiss
-
Patent number: 7624363Abstract: A method for performing equivalence checking on logic circuit designs is disclosed. Within a composite netlist of an original version and a modified version of a logic circuit design, all level-sensitive sequential elements sensitized by a clock=0 are converted into buffers, and all level-sensitive sequential elements sensitized by a clock=1 are converted into level-sensitive registers. A subset of edge-sensitive sequential elements are selectively transformed into level-sensitive sequential elements by removing edge detection logic from the subset of the edge-sensitive sequential elements. A clock to the resulting sequential elements is then set to a logical “1” to verify the sequential equivalence of the transformed netlist.Type: GrantFiled: February 27, 2007Date of Patent: November 24, 2009Assignee: International Business Machines CorporationInventors: Jason R. Baumgartner, Tobias Gemmeke, Nicolas Maeding, Kai O. Weber
-
Publication number: 20090249035Abstract: A method of reducing latency in instruction processing in a system, includes calculating a result of a first execution unit, storing the result of the first execution unit in a register file, forwarding the result of the first execution unit, through the bypass unit, to a second execution unit, the second execution unit conducting an instruction dependent on the result, forwarding the result of the first execution unit, from the bypass unit, to a third execution unit, without accessing the register file, the third execution unit conducting an instruction dependent on the result, wherein the execution units can extract the result of the first execution unit through the bypass unit until the new result is calculated, wherein after the new result is calculated, the execution units can access the result of the first execution unit through the register file.Type: ApplicationFiled: March 28, 2008Publication date: October 1, 2009Applicant: International Business Machines CorporationInventors: Harry Barowski, Tobias Gemmeke, Nicolas Maeding, Tim Niggemeier
-
Publication number: 20090135961Abstract: System and Method for Scanning Sequential Logic Elements A digital system and method for scanning sequential logic elements are disclosed. The digital system may comprise a plurality of sequential logic elements subdivided into power domains, wherein at least one of the power domains is power gated; a scan chain configured for processing a scan data sequence; a scan enable switch configured for controlling a scan mode; and at least one shadow engine, wherein the at least one shadow engine comprises a control circuit. At least some of the power domains may be interconnected to the scan chain with the scan enable switch, and the scan enable switch may control the scan mode by asserting a scan enable signal. The at least one power gated power domain with one or more sequential logic elements to be power gated may be bypassed via the at least one shadow engine.Type: ApplicationFiled: November 19, 2008Publication date: May 28, 2009Applicant: International Business Machines CorporationInventors: Tobias Gemmeke, Dieter Wendel, Holger Wetter, Jens Leenstra
-
Publication number: 20090115504Abstract: A three stage circuit according to the invention comprises a data input, a data output, a control input, two voltage supply inputs. The first stage is electrically connected to the data input and control input and is defined by a combinatorial circuitry with two outputs. The second stage is defined by at least two transistors connected in series between the two voltage supply inputs with their inputs electrically connected to the respective outputs of the first stage and with a common output such that in connection with the first stage they operate as a tri-state gate. The third stage of that three stage circuit is electrically connected to the control input and the common output of the second stage.Type: ApplicationFiled: October 31, 2008Publication date: May 7, 2009Applicant: International Business Machines CorporationInventors: Tobias Gemmeke, Friedrich Schroeder, Stefan Bonsels, Dieter Wendel
-
Patent number: 7509511Abstract: A method for reducing leakage current within a register file of a processor is disclosed. The register file within the processor is partitioned into at least two power domains, and each of the two power domains can be powered independently. At least one of the two power domains includes at least as many physical registers as there are architected registers defined in an instruction set architecture of the processor. In response to an occurrence of an idle condition within the processor, all architected register file entries are consolidated into one of power domains that will not be powered off, and the power domains that does not contain any architected register file entries after consolidating are powered off. Afterwards, in response to a detection of an end of the idle condition, all of the power domains are powered back on.Type: GrantFiled: May 6, 2008Date of Patent: March 24, 2009Assignee: International Business Machines CorporationInventors: Harry S. Barowski, Tobias Gemmeke, Jens Leenstra, Tim Niggemeier
-
Patent number: 7502918Abstract: A method of dispatching instructions includes dispatching original instructions into an instruction buffer, including at least one operand, renaming the operand, selecting the original instructions from the instruction buffer, sending selected instructions with explicit bits, to an internal operation code exchange table, which includes replacement rules for replacing the selected instructions with a simplified instruction based on the original instructions and the explicit bits, replacing the selected instructions with the simplified instruction in accordance with the explicit bits, and issuing the simplified instructions to an execution unit by sending the simplified instruction and all explicit bits for the operands to a content addressable memory address logic of the internal operation code exchange table, wherein if a bitvector, consisting of the original instruction and the explicit bits, matches a pattern stored in the internal operation code exchange table, the original instruction is replaced by the sType: GrantFiled: March 28, 2008Date of Patent: March 10, 2009Assignee: International Business Machines CorporationInventors: Harry Barowski, Tobias Gemmeke, Tim Niggemeier, Thomas Pflueger
-
Publication number: 20080288901Abstract: The present invention provides a fully automatic method for obtaining a circuit having minimized power consumption due to clock-gating. A circuit design to be optimized is modified to a reduced power modified design and associated with a clock gating scheme. Verification tools compare the modified design with the original design to a predetermined trigger-events to determine if the modified design can be used. Further modifications may be made iteratively until an optimal design is achieved.Type: ApplicationFiled: April 23, 2008Publication date: November 20, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Harry Barowski, J. Adam Butts, Tobias Gemmeke, Nicolas Maeding, Viresh Paruthi
-
Publication number: 20080276140Abstract: A semiconductor chip subdivided into power domains, at least one of the power domains is separately activated or deactivated and at least a part of the scannable storage elements are interconnected to one or more scan chains. At least one scan chain is serially subdivided into scan chain portions and the scan chain portion is arranged within one of the power domains. For at least one scan chain portion a bypass line is provided for passing by scan data and at least one select unit is provided for selecting between the bypass line and the corresponding scan chain portion in dependence of the activated or deactivated state of the corresponding power domains.Type: ApplicationFiled: March 5, 2008Publication date: November 6, 2008Inventors: Tobias Gemmeke, Christoph Jaeschke, Jens Kuenzer, Cedric Lichtenau, Thomas Pflueger, Jochen Preiss
-
Publication number: 20080209287Abstract: A method for performing equivalence checking on logic circuit designs is disclosed. Within a composite netlist of an original version and a modified version of a logic circuit design, all level-sensitive sequential elements sensitized by a clock=0 are converted into buffers, and all level-sensitive sequential elements sensitized by a clock=1 are converted into level-sensitive registers. A subset of edge-sensitive sequential elements are selectively transformed into level-sensitive sequential elements by removing edge detection logic from the subset of the edge-sensitive sequential elements. A clock to the resulting sequential elements is then set to a logical “1” to verify the sequential equivalence of the transformed netlist.Type: ApplicationFiled: February 27, 2007Publication date: August 28, 2008Inventors: Jason R. Baumgartner, Tobias Gemmeke, Nicolas Maeding, Kai O. Weber
-
Publication number: 20080169842Abstract: A design structure to reduce power consumption within a clock gated synchronous circuit, said synchronous circuit comprising at least two successive stages, wherein each stage if activated propagates a data signal cycle by cycle to a succeeding stage the two successive stages comprising at least a control register, a data register and a local clock buffer (LCB) each, wherein each stage if activated propagates a data signal stored within the data register cycle by cycle to a data register of a succeeding stage.Type: ApplicationFiled: September 6, 2007Publication date: July 17, 2008Inventors: Tobias Gemmeke, Jens Leenstra, Jochen Preiss
-
Publication number: 20080169841Abstract: A method to reduce power consumption within a clock gated synchronous circuit, said synchronous circuit comprising at least two successive stages, wherein each stage if activated propagates a data signal cycle by cycle to a succeeding stage, comprising the steps of: deriving a local clock activation signal from an external clock activation signal, wherein said local clock activation signal changes its value every cycle the external clock activation signal indicates a propagation, propagating the data signal and the local clock activation signal synchronously cycle by cycle from a particular stage to a succeeding stage whenever a local clock activation signal at the particular stage by derivation from the clock activation signal or by propagation through the synchronous circuit changes its value between two successive cycles, in order to propagate the data signal and the local clock activating signal within the same clock domain through the clock gated synchronous circuit.Type: ApplicationFiled: September 6, 2007Publication date: July 17, 2008Inventors: Tobias Gemmeke, Jens Leenstra, Jochen Preiss
-
Publication number: 20080162897Abstract: A binary logic unit to apply any Boolean operation on two input signals (va, vb) is described, wherein any Boolean operation to be applied on the input signals (va, vb) is defined by a particular combination of well defined control signals (ctl0, ctl1, ctl2, ctl3), wherein the input signals (va, vb) are used to select a control signal (ctl0, ctl1, ctl2, ctl3) as an output signal (vo) of the binary logic unit representing the result of a particular Boolean operation applied on the two input signals (va, vb). Furthermore a method to operate such a binary logic unit is described.Type: ApplicationFiled: October 16, 2007Publication date: July 3, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tobias Gemmeke, Jochen Preiss
-
Publication number: 20080130871Abstract: A permute unit is described comprising a permute logic and a crossbar working in cycles defined by clocking signals and generating one valid output vector per cycle by treating two parallel input vectors per cycle according to an adequate scheme, wherein the permute unit is double pumped by performing two inner cycles per outer cycle defined by the clocking signals, wherein in every first inner cycle first halves of both input vectors are treated and in every second inner cycle second halves of both input vectors are treated and wherein every second inner cycle a valid output vector is generated from the results of the treatments within the first and the second inner cycles. Furthermore a method is described to operate such a permute unit.Type: ApplicationFiled: October 16, 2007Publication date: June 5, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tobias Gemmeke, Jens Leenstra, Dieter Wendel
-
Publication number: 20070226664Abstract: The automatic verification of designs of digital circuits for their equivalence, wherein logic designs implemented in different hardware description languages (HDLs) and different design methodologies are compared. The designs (Code A, Code B) are modified by adding special wrappers (Wrapper A, Wrapper B), and used to equalize the timing of pairs of selected input signals and selected output signals of the logic designs. The wrappers drive certain signals of the designs that are not relevant for actual comparison, such signals including clock signals, clock control signals, scan-path signals, scan-path control signals, and reset signals. In a preferred embodiment, HDL descriptions of logic designs are analyzed. Based on this analysis, the wrappers are implemented as changes to the HDL descriptions. In another embodiment, RTL and/or gate-level netlists are analyzed and modified.Type: ApplicationFiled: March 12, 2007Publication date: September 27, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tobias Gemmeke, Jens Leenstra, Nicolas Maeding, Hari Mony
-
Publication number: 20070180016Abstract: An electronic computing circuit for implementing a method for reducing the bit width of two operands from a bit length N to a reduced bit length M, thus, M<N. To enable a wider re-usage of existing designs or building blocks being all specialised to the usual bit length of a power of 2 (8, 16, 32, 64 etc.), the chip structure of which is already highly optimised in regard of speed and space savings, a circuit is implemented as an addend width reduction circuit to perform the steps of: receiving said two N-bit operands as an input, adding the (N-M+1) most significant bits of said two N-bit operands separately in an auxiliary adder logic, calculating at least the two most significant bits of reduced-bit-length output operands in a decision logic processing the add result of said auxiliary adder logic, such that a predetermined post-processing can be correctly performed with said output operands.Type: ApplicationFiled: November 15, 2006Publication date: August 2, 2007Inventors: Tobias Gemmeke, Jens Leenstra, Nicolas Maeding, Kerstin Schelm
-
Publication number: 20070168792Abstract: A method to reduce leakage within a sequential network comprising at least one latch and a combinatorial logic proximate to said latch, by applying an input vector on said sequential network during idle mode is described, the method comprising the steps of: overriding a static feedback of a latch comprising a static feedback loop with an input vector, and setting said sequential network into idle mode. Furthermore a latch circuit comprising a static feedback loop, to be used to perform said method is described, wherein said latch circuit comprises means to override a static feedback within said static feedback loop with an input vector before falling in idle mode.Type: ApplicationFiled: December 4, 2006Publication date: July 19, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Harry Barowski, Tobias Gemmeke, Christian Jacobi, Matthias Pflanz
-
Publication number: 20070165343Abstract: A Circuit arrangement to reduce leakage power and to increase the performance of a circuit comprising three electric potentials is described, wherein a diode is arranged between the third and the second or first electric potential to obtain a potential drop of the third electric potential and parallel to said diode a switch is arranged between the third and the second or between the third and the first electric potential to change the potential drop of the third electric potential opposite to the first or the second electric potential about the voltage drop of said diode wherein said switch comprises a transistor having a broad transistor channel. Furthermore a method to reduce leakage power and to increase the performance of a circuit by using said circuit arrangement is described.Type: ApplicationFiled: October 26, 2006Publication date: July 19, 2007Inventors: Harry Barowski, Sebastian Ehrenreich, Tobias Gemmeke, Jens Leenstra