Patents by Inventor Nicolas Maeding
Nicolas Maeding 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: 7890901Abstract: 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: GrantFiled: March 12, 2007Date of Patent: February 15, 2011Assignee: International Business Machines CorporationInventors: Tobias Gemmeke, Jens Leenstra, Nicolas Maeding, Hari Mony
-
Patent number: 7849428Abstract: 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: GrantFiled: April 23, 2008Date of Patent: December 7, 2010Assignee: International Business Machines CorporationInventors: Harry Barowski, J. Adam Butts, Tobias Gemmeke, Nicolas Maeding, Viresh Paruthi
-
Patent number: 7783690Abstract: A crossbar (20) circuit with multiplexer (22A, 22B) circuits implemented in a polygonal form on a chip. The crossbar can be used for implementing a permutation of input bits (24A, 24B) controlled by a bit vector (25). Horizontal and vertical wiring lengths in the crossbar (20) are reduced by stacking the operand latches (24A, 24B, 25) and horizontal or vertical multiplexers (22A, 22B). This implementation decreases the latency of the crossbar and avoids latches to store intermediated results, thus reducing area and power consumption.Type: GrantFiled: March 28, 2006Date of Patent: August 24, 2010Assignee: International Business Machines CorporationInventors: Jens Leenstra, Nicolas Maeding, Amaury Neve de Mevergnies, Hans-Werner Tast
-
Publication number: 20100199074Abstract: Instead of having a processor with an instruction set architecture (ISA) that includes fixed architected operands, an improved processor supports additional characteristic bits for computing instructions (e.g., a multiply-add, load/store instructions). Such additional bits for the certain instructions influence the processing of these instructions by the processor. Also, a new instruction is introduced for further usage of the proposed method. Typically these additional characteristic bits as well as the instruction can be automatically generated by compilers to provide relatively well-suited instruction sequences for the processor.Type: ApplicationFiled: February 5, 2009Publication date: August 5, 2010Applicant: International Business Machines CorporationInventors: Tobias Gemmeke, Markus Kaltenbach, Nicolas Maeding
-
Patent number: 7769986Abstract: A method and apparatus for register renaming are provides in the illustrative embodiments. A mapper receives a request for a data in a logical register. The mapper searches an in-flight map table and a set of architected map tables for the data in the logical register. The mapper identifies an entry in one of the in-flight map table and an architected map table in the set of architected map tables that corresponds with the logical register in the request. The mapper returns a location of a physical register, which holds the requested data.Type: GrantFiled: May 1, 2007Date of Patent: August 3, 2010Assignee: International Business Machines CorporationInventors: Christopher Michael Abernathy, William Elton Burky, Jens Leenstra, Nicolas Maeding
-
Patent number: 7676778Abstract: A novel method for optimizing the design of digital circuits containing clock gated memory elements. The method unclock gates memory elements by adding necessary feedback loops. Logic functions of memory element outputs in the circuit are viewed as a whole, rather than as separate functions for each input. Detection of duplicate unclock gated memory elements is then effected by identifying identical canonical representations of said unclock gated memory elements. Identified duplicate clock gated memory elements can then be eliminated from the original digital circuit. Further optimization can be accomplished by applying standard logic optimization algorithms to all unclock gated memory elements in said digital circuit. The resulting optimized circuit is clock gated and replaces the original clock gated circuit in said digital circuit.Type: GrantFiled: July 4, 2007Date of Patent: March 9, 2010Assignee: International Business Machines CorporationInventors: Eli Arbel, Cynthia Rae Eisner, Alexander Itskovich, Nicolas Maeding
-
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
-
Publication number: 20090292892Abstract: A method for reducing the power consumption of a register file of a microprocessor supporting simultaneous multithreading (SMT) is disclosed. Mapping logic and associated table entries monitor a total number of processing threads currently executing in the processor and signal control logic to disable specific register file entries not required for currently executing or pending instruction threads or register file entries not meeting a minimum access threshold using a least recently used algorithm (LRU). The register file utilization is controlled such that a register file address range selected for deactivation is not assigned for pending or future instruction threads. One or more power saving techniques are then applied to disabled register files to reduce overall power dissipation in the system.Type: ApplicationFiled: May 15, 2008Publication date: November 26, 2009Inventors: Christopher M. Abernathy, Jens Leenstra, Nicolas Maeding, Dung Quoc Nguyen
-
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: 20090013289Abstract: A novel method for optimizing the design of digital circuits containing clock gated memory elements. The method unclock gates memory elements by adding necessary feedback loops. Logic functions of memory element outputs in the circuit are viewed as a whole, rather than as separate functions for each input. Detection of duplicate unclock gated memory elements is then effected by identifying identical danonical representations of said unclock gated memory elements. Identified duplicate clock gated memory elements can then be eliminated from the original digital circuit. Further optimization can be accomplished by applying standard logic optimization algorithms to all unclock gated memory elements in said digital circuit. The resulting optimized circuit is clock gated and replaces the original clock gated circuit in said digital circuit.Type: ApplicationFiled: July 4, 2007Publication date: January 8, 2009Inventors: Eli Arbel, Cynthia Rae Eisner, Alexander Itskovich, Nicolas Maeding
-
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: 20080276076Abstract: A method and apparatus for register renaming are provides in the illustrative embodiments. A mapper receives a request for a data in a logical register. The mapper searches an in-flight map table and a set of architected map tables for the data in the logical register. The mapper identifies an entry in one of the in-flight map table and an architected map table in the set of architected map tables that corresponds with the logical register in the request. The mapper returns a location of a physical register, which holds the requested data.Type: ApplicationFiled: May 1, 2007Publication date: November 6, 2008Inventors: Christopher Michael Abernathy, William Elton Burky, Jens Leenstra, Nicolas Maeding
-
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: 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: 20070011220Abstract: A crossbar (20) circuit with multiplexer (22A, 22B) circuits implemented in a polygonal form on a chip. The crossbar can be used for implementing a permutation of input bits (24A, 24B) controlled by a bit vector (25). Horizontal and vertical wiring lengths in the crossbar (20) are reduced by stacking the operand latches (24A, 24B, 25) and horizontal or vertical multiplexers (22A, 22B). This implementation decreases the latency of the crossbar and avoids latches to store intermediated results, thus reducing area and power consumption.Type: ApplicationFiled: March 28, 2006Publication date: January 11, 2007Inventors: Jens Leenstra, Nicolas Maeding, Amaury Mevergnies, Hans-Werner Tast